𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kneser's conjecture, chromatic number, and homotopy

✍ Scribed by L Lovász

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
297 KB
Volume
25
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multichromatic numbers, star chromatic n
Multichromatic numbers, star chromatic numbers and Kneser graphs
✍ Johnson, A.; Holroyd, F. C.; Stahl, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by χ \* and η \* , the work of the above authors shows that χ \* (G) = η \* (G) if G is bipartite, an odd cy

Star chromatic number
Star chromatic number
✍ A. Vince 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB
Edge-face chromatic number and edge chro
Edge-face chromatic number and edge chromatic number of simple plane graphs
✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function ϕ : __E__(__G__) ∪ __F__(G) →  {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) ∪ __F__(__G__), ϕ(__a__) ≠ ϕ(__b__). Let χ~e~(__G__), χ~ef~(__G__), and Δ(__G_

Induced Cycles and Chromatic Number
Induced Cycles and Chromatic Number
✍ A.D. Scott 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We prove that, for any pair of integers k, l 1, there exists an integer N(k, l ) such that every graph with chromatic number at least N(k, l ) contains either K k or an induced odd cycle of length at least 5 or an induced cycle of length at least l.