✦ LIBER ✦

Graphs with small chromatic numbers are easy to color

✍ Scribed by Luděk Kučera

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On coloring graphs with locally small ch

✍ H. A. Kierstead; E. Szemerédi; W. T. Trotter 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 123 KB

Distance graphs with large chromatic num

✍ A. B. Kupavskii, A. M. Raigorodskii 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 232 KB

Why Almost Allk-Colorable Graphs Are Eas

✍ Amin Coja-Oghlan; Michael Krivelevich; Dan Vilenchik 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 910 KB

Almost all k-colorable graphs are easy t

✍ Jonathan S Turner 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Total chromatic number of graphs with sm

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 338 KB

On graphs with small subgraphs of large

✍ V. Rödl; R. A. Duke 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 296 KB