On the chromatic number of pentagon-free graphs of large minimum degree
From MaRDI portal
Publication:2460625
DOI10.1007/s00493-007-0054-1zbMath1135.05303WikidataQ56926662 ScholiaQ56926662MaRDI QIDQ2460625
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
05C15: Coloring of graphs and hypergraphs
Related Items
On the structure of Dense graphs with bounded clique number, On the Chromatic Thresholds of Hypergraphs, Kernelization for cycle transversal problems, On the chromatic number of \(H\)-free graphs of large minimum degree, A note on generalized pentagons, Homomorphism thresholds for odd cycles, Cycles with consecutive odd lengths, Odd circuits in dense binary matroids, New kernels for several problems on planar graphs, Critical graphs without triangles: an optimum density construction, On a conjecture of Erdős and Simonovits: even cycles, Hypergraphs with zero chromatic threshold