A 4-colour problem for dense triangle-free graphs

DOI10.1016/S0012-365X(01)00340-5zbMath1003.05040OpenAlexW2075003686MaRDI QIDQ1613467

Stephan Brandt

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00340-5

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the Structure of Graphs with Given Odd Girth and Large Minimum Degree ⋮ On degree sums of a triangle-free graph ⋮ Triangle-free graphs whose independence number equals the degree ⋮ Colouring Vertices of Triangle-Free Graphs ⋮ Colouring vertices of triangle-free graphs without forests

This page was built for publication: A 4-colour problem for dense triangle-free graphs