Structure in sparse \(k\)-critical graphs

DOI10.1016/j.jctb.2022.04.004zbMath1490.05144arXiv2107.00976OpenAlexW3181044363MaRDI QIDQ2673484

Victor Larsen, Luke Postle, Ronald J. Gould

Publication date: 10 June 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.00976

zbMATH Keywords

graph coloringcritical graphspotential method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• On the minimum edge-density of 5-critical triangle-free graphs
• Ore's conjecture on color-critical graphs is almost true
• On the minimal number of edges in color-critical graphs
• A Brooks-type result for sparse critical graphs
• Three-coloring Klein bottle graphs of girth five
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Extracting List Colorings from Large Independent Sets
• The structure of k-chromatic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structure in sparse \(k\)-critical graphs