✦ LIBER ✦

On graphs with a large chromatic number that contain no small odd cycles

✍ Scribed by S. L. Berlov, I. I. Bogdanov

Book ID: 113072924
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 260 KB
Volume: 184
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-012-0882-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with small subgraphs of large

On graphs with small subgraphs of large chromatic number

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

Graphs with large maximum degree contain

Graphs with large maximum degree containing no odd cycles of a given length

✍ Paul Balister; Béla Bollobás; Oliver Riordan; Richard H. Schelp 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

On coloring graphs with locally small ch

On coloring graphs with locally small chromatic number

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

On embedding of finite distance graphs w

On embedding of finite distance graphs with large chromatic number in random graphs

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 293 KB

On proving that a graph has no large cli

On proving that a graph has no large clique: A connection with Ramsey theory

✍ Richard J. Lipton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Graphs That Do Not Contain a Cycle with

Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It

✍ Aboulker, Pierre; Radovanović, Marko; Trotignon, Nicolas; Vušković, Kristina 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 304 KB