✦ LIBER ✦

A Lower Bound for the One-Chromatic Number of a Surface

✍ Scribed by V.P. Korzhik

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 487 KB
Volume: 61
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB 👁 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB

A New Bound on the Cyclic Chromatic Numb

A New Bound on the Cyclic Chromatic Number

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In 1969, Ore and Plummer defined an angular coloring as a natural extension of the Four Color Problem: a face coloring of a plane graph where faces meeting even at a vertex must have distinct colors. A natural lower bound is the maximum degree 2 of the graph. Some graphs require w 3 2 2x colors in a

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Improved bounds for the chromatic number

Improved bounds for the chromatic number of a graph

✍ S. Louis Hakimi; Edward Schmeichel 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_