✦ LIBER ✦

Grotzsh's heawood coloring theorem

✍ Scribed by Steve Fisk

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 77 KB
Volume: 15
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(75)90130-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new solution for the nonorientable cas

A new solution for the nonorientable case 1 of the heawood Map Color Theorem

✍ M Jungerman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 127 KB

K�nig's edge coloring theorem without au

K�nig's edge coloring theorem without augmenting paths

✍ Rizzi, Romeo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

basic fact [1, 2] in matching theory.

Impossible colorings and Bell's theorem

✍ P.K. Aravind 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 51 KB

Dirac's map-color theorem for choosabili

Dirac's map-color theorem for choosability

✍ B�hme, T.; Mohar, B.; Stiebitz, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

It is proved that the choice number of every graph G embedded on a surface of Euler genus ε ≥ 1 and ε = 3 is at most the Heawood number H(ε) = (7 + √ 24ε + 1)/2 and that the equality holds if and only if G contains the complete graph K H(ε) as a subgraph.

A Hajós-like theorem for list coloring

✍ Sylvain Gravier 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 210 KB

On Improving the Edge-Face Coloring Theo

On Improving the Edge-Face Coloring Theorem

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 135 KB