Characterizing 4-critical graphs with Ore-degree at most seven

DOI10.1016/J.JCTB.2017.09.010zbMath1379.05041arXiv1409.5116OpenAlexW2962723552MaRDI QIDQ684124

Luke Postle

Publication date: 9 February 2018

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

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

zbMATH Keywords

graph coloringpotential methodOre-degree4-critical graphs

Mathematics Subject Classification ID

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

Related Items (2)

Critical graphs for the chromatic edge-stability number ⋮ A density bound for triangle‐free 4‐critical graphs

Cites Work

• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Graphs with chromatic number close to maximum degree
• Ore's conjecture on color-critical graphs is almost true
• Ore-type versions of Brooks' theorem
• A Brooks-type result for sparse critical graphs
• Improved lower bounds on the number of edges in list critical and online list critical graphs
• The Colouring of Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing 4-critical graphs with Ore-degree at most seven