Cycle length parities and the chromatic number

DOI10.1002/jgt.20450zbMath1209.05091OpenAlexW4237114318MaRDI QIDQ3055917

Dieter Rautenbach, Ingo Schiermeyer, Christian Löwenstein

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00011842

zbMATH Keywords

graphcyclechromatic numbercoloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Problems on cycles and colorings ⋮ Circumference, chromatic number and online coloring ⋮ Coloring digraphs with forbidden cycles ⋮ Subdivisions of four blocks cycles in digraphs with large chromatic number

Cites Work

• Colourings of graphs with two consecutive odd cycle lengths
• A bound on the chromatic number using the longest odd cycle length
• On chromatic number of graphs and set-systems

This page was built for publication: Cycle length parities and the chromatic number