4-chromatic graphs with large odd girth

DOI10.1016/0012-365X(94)00221-4zbMath0819.05025MaRDI QIDQ1842185

Nguyen Van Ngoc, Zsolt Tuza

Publication date: 27 August 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

girthMycielski graph4-chromatic graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Questions on color-critical subgraphs ⋮ Reconfiguring graph homomorphisms on the sphere ⋮ Small odd cycles in 4-chromatic graphs ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Symmetry parameters for Mycielskian graphs ⋮ On graphs with strongly independent color-classes ⋮ Generalised Mycielski graphs and the Borsuk-Ulam theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• On coloring graphs with locally small chromatic number
• Graph coloring in linear time
• On color critical graphs
• On constructive methods in the theory of colour-critical graphs
• Sur le coloriage des graphs

This page was built for publication: 4-chromatic graphs with large odd girth