Short odd cycles in 4-chromatic graphs

DOI10.1002/(SICI)1097-0118(199906)31:2%3C145::AID-JGT7%3E3.0.CO;2-EzbMATH Open0924.05044OpenAlexW4251845466MaRDI QIDQ4248538FDOQ4248538

Authors: Noga Alon 

Publication date: 10 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199906)31:2%3C145::aid-jgt7%3E3.0.co;2-e

zbMATH Keywords

chromatic numbercycleodd girth4-chromatic graph

Mathematics Subject Classification ID

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

Cited In (5)

• Two results on the digraph chromatic number
• Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
• Small odd cycles in 4-chromatic graphs
• 4-chromatic graphs with large odd girth
• What must and what need not be contained in a graph of uncountable chromatic number?

This page was built for publication: Short odd cycles in 4-chromatic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248538)