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

DOI10.1016/S0012-365X(98)00083-1zbMath0958.05056MaRDI QIDQ1584347

Nedyalko Dimov Nenov

Publication date: 2 November 2000

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

zbMATH Keywords

chromatic numbersmall graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item ⋮ On the triangle vertex Folkman numbers ⋮ On the nonexistence of some generalized Folkman numbers

Cites Work

• The size of a minimum five-chromatic \(K_ 4\)-free graph
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item