✦ LIBER ✦

List Colouring When The Chromatic Number Is Close To the Order Of The Graph

✍ Scribed by Bruce Reed*; Benny Sudakov†

Book ID: 106167542
Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 151 KB
Volume: 25
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-005-0010-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The list-chromatic number of infinite gr

The list-chromatic number of infinite graphs

✍ Péter Komjáth 📂 Article 📅 2013 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 270 KB

The list chromatic numbers of some plana

The list chromatic numbers of some planar graphs

✍ Lü Enyue; Zhang Kemin 📂 Article 📅 1999 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 438 KB

The chromatic number of the product of t

The chromatic number of the product of two 4-chromatic graphs is 4

✍ Mohamed El-Zahar; Norbert Sauer 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 326 KB

The List-Chromatic Number of Infinite Gr

The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces

✍ Péter Komjáth 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 223 KB

The list of chromatically unique graphs

The list of chromatically unique graphs of order seven and eight

✍ Nian-Zu Li 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 947 KB

Note. In the following list, Gij (resp., gij) denotes the jth chromatically unique graph of size i and order 7 (resp., order 8). A graph with a 'C' represents its complement.

The total chromatic number of regular gr

The total chromatic number of regular graphs whose complement is bipartite

✍ J.K. Dugdale; A.J.W. Hilton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 705 KB

We show that a regular graph G of order at least 6 whose complement c is bipartite has total chromatic number d(G) + 1 if and only if (i) G is not a complete graph, and (ii) G#K when n is even. As an aid in"';he proof of this, we also show that , for n>4, if the edges of a Hamiltonian path of Kzn a