On the number of edges in colour-critical graphs and hypergraphs

DOI10.1007/s004930070005zbMath0996.05046OpenAlexW2021328395MaRDI QIDQ5932753

Alexandr V. Kostochka, Michael Stiebitz

Publication date: 13 June 2001

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930070005

zbMATH Keywords

colour-critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Coloring, sparseness and girth ⋮ On the minimum number of edges in triangle-free 5-critical graphs ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ Critical graphs without triangles: an optimum density construction ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ On the critical point-arboricity graphs ⋮ A local epsilon version of Reed's conjecture ⋮ A list version of Dirac's theorem on the number of edges in colour-critical graphs ⋮ The local cut lemma

This page was built for publication: On the number of edges in colour-critical graphs and hypergraphs