The size of a minimum five-chromatic \(K_ 4\)-free graph

DOI10.1016/0012-365X(93)90309-HzbMath0788.05044OpenAlexW2043684617MaRDI QIDQ1313876

Gary MacGillivray, Dale Youngs, Denis Hanson

Publication date: 6 June 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90309-h

zbMATH Keywords

chromatic numberfive-chromatic graphGrötzsch graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the small graphs with chromatic number 5 without 4-cliques

Cites Work

• Small graphs with chromatic number 5: A computer search
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The size of a minimum five-chromatic \(K_ 4\)-free graph