Color-critical graphs have logarithmic circumference

DOI10.1016/J.AIM.2011.05.001zbMath1218.05055arXiv0908.3169OpenAlexW2106626905MaRDI QIDQ550393

Asaf Shapira, Robin Thomas

Publication date: 8 July 2011

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

connectivitycritical graphslong cycles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

Counting critical subgraphs in \(k\)-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative lengths of paths and cycles in 3-connected graphs
• Circuits in critical graphs
• Maximal Circuits in Critical Graphs
• Long cycles in critical graphs
• On the structure of 5- and 6-chromatic abstract graphs.
• Some Theorems on Abstract Graphs
• Paths and Circuits in Critical Graphs

This page was built for publication: Color-critical graphs have logarithmic circumference