Properties of 8-contraction-critical graphs with no \(K_7\) minor

DOI10.1016/j.ejc.2023.103711OpenAlexW4327591245MaRDI QIDQ2701012

Martin Rolek, Robin Thomas, Zi-Xia Song

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05Cxx) Combinatorial probability (60Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rooted \(K_4\)-minors
• Lower bound of the Hadwiger number of graphs by their average degree
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• On the list coloring version of Reed's conjecture
• On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Coloring graphs with forbidden minors
• Homomorphiesätze für Graphen
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• Hadwiger’s Conjecture
• Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
• An extremal function for contractions of graphs
• Minors in graphs of large girth
• Minors in ‐ Chromatic Graphs, II
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Properties of 8-contraction-critical graphs with no \(K_7\) minor