Colour-critical graphs with few edges

DOI10.1016/S0012-365X(98)00100-9zbMath0955.05042MaRDI QIDQ1584424

Michael Stiebitz, Alexandr V. Kostochka

Publication date: 2 November 2000

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

zbMATH Keywords

chromatic number\(k\)-critical graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Generalized DP-colorings of graphs ⋮ On the edge-density of 4-critical graphs ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ A list version of Dirac's theorem on the number of edges in colour-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimal number of edges in color-critical graphs
• The colour theorems of Brooks and Gallai extended
• An improved bound on the minimal number of edges in color-critical graphs
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• The number of edges in critical graphs.

This page was built for publication: Colour-critical graphs with few edges