On the chromatic number of pentagon-free graphs of large minimum degree

DOI10.1007/s00493-007-0054-1zbMath1135.05303OpenAlexW4252715293WikidataQ56926662 ScholiaQ56926662MaRDI QIDQ2460625

Carsten Thomassen

Publication date: 12 November 2007

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-007-0054-1

zbMATH Keywords

chromatic numberpentagon-free graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Hypergraphs with zero chromatic threshold ⋮ Minimum degree and the graph removal lemma ⋮ Cycles with consecutive odd lengths ⋮ Kernelization for cycle transversal problems ⋮ The minimum degree removal lemma thresholds ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Odd circuits in dense binary matroids ⋮ Critical graphs without triangles: an optimum density construction ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ A note on generalized pentagons ⋮ New kernels for several problems on planar graphs ⋮ On the structure of Dense graphs with bounded clique number ⋮ Homomorphism thresholds for odd cycles

This page was built for publication: On the chromatic number of pentagon-free graphs of large minimum degree