An improved bound on the minimal number of edges in color-critical graphs

zbMath0885.05063MaRDI QIDQ1379126

Michael Krivelevich

Publication date: 18 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119251

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On the spectral moment of graphs with given clique number ⋮ Spectral radii of graphs with given chromatic number ⋮ On the edge-density of 4-critical graphs ⋮ Signless Laplacian spectral radii of graphs with given chromatic number ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ Colour-critical graphs with few edges

This page was built for publication: An improved bound on the minimal number of edges in color-critical graphs