scientific article; zbMATH DE number 1303523

zbMATH Open0928.05023MaRDI QIDQ4250145FDOQ4250145

Authors: Alexandr Kostochka, Michael Stiebitz 

Publication date: 9 January 2000

Title of this publication is not available (Why is that?)

Recommendations

• Colour-critical graphs with few edges
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• On the minimal number of edges in color-critical graphs

zbMATH Keywords

chromatic number\(k\)-critical graph

Mathematics Subject Classification ID

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

Cited In (15)

• On the minimum number of arcs in \(k\)-dicritical oriented graphs
• A list version of Dirac's theorem on the number of edges in colour-critical graphs
• New lower bounds on the number of edges of critical graphs
• Ore's conjecture on color-critical graphs is almost true
• Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs
• On the edge-density of 4-critical graphs
• On the number of edges in colour-critical graphs and hypergraphs
• On the maximum number of edges in \(k\)-critical graphs
• Structure in sparse \(k\)-critical graphs
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• On list critical graphs
• Edge lower bounds for list critical graphs, via discharging
• Supersaturation problem for color-critical graphs
• Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
• Minimalk-saturated and color critical graphs of prescribed minimum degree

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250145)