Recommendations
- On the minimal number of edges in color-critical graphs
- Color-critical graphs and hypergraphs with few edges: a survey
- Color-critical graphs and hypergraphs with few edges and no short cycles
- scientific article; zbMATH DE number 3924804
- On color critical graphs
- scientific article; zbMATH DE number 4095495
- Color critical hypergraphs with many edges
- On the number of edges in colour-critical graphs and hypergraphs
- scientific article; zbMATH DE number 4168720
- An improved bound on the minimal number of edges in color-critical graphs
Cites work
- scientific article; zbMATH DE number 3232667 (Why is no real title available?)
- scientific article; zbMATH DE number 3195967 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- An improved bound on the minimal number of edges in color-critical graphs
- On the minimal number of edges in color-critical graphs
- The colour theorems of Brooks and Gallai extended
- The number of edges in critical graphs.
Cited in
(38)- On color critical graphs
- Characterizing 4-critical graphs with Ore-degree at most seven
- Note on robust critical graphs with large odd girth
- scientific article; zbMATH DE number 3979084 (Why is no real title available?)
- A list version of Dirac's theorem on the number of edges in colour-critical graphs
- Color-critical graphs have logarithmic circumference
- Dense critical and vertex-critical graphs
- Counting substructures. I: Color critical graphs
- On complete subgraphs of color-critical graphs
- scientific article; zbMATH DE number 1923176 (Why is no real title available?)
- scientific article; zbMATH DE number 4075110 (Why is no real title available?)
- Edge-coloring critical graphs with high degree
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs
- Minimal orientations of colour critical graphs
- On the edge-density of 4-critical graphs
- A note on a conjecture of Dirac
- Hajós theorem for colorings of edge-weighted graphs
- Critically cochromatic graphs
- Order plus size of τ‐critical graphs
- Ore's conjecture for \(k=4\) and Grötzsch's theorem
- Note to a problem of T. Gallai and G. A. Dirac
- Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
- Tight bounds towards a conjecture of Gallai Jun Gao1
- On the maximum number of edges in \(k\)-critical graphs
- On the minimal number of edges in color-critical graphs
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- Structure in sparse \(k\)-critical graphs
- The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
- Generalized DP-colorings of graphs
- Edge lower bounds for list critical graphs, via discharging
- Counting critical subgraphs in \(k\)-critical graphs
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
- Gallai's problem on Dirac's construction
- On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs
- A Problem in Graph Theory
- Graphs with least number of colorings
- Bounds and monotonicity of critical set parameters of colourings
- scientific article; zbMATH DE number 4123758 (Why is no real title available?)
This page was built for publication: Colour-critical graphs with few edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584424)
