Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture

DOI10.1016/j.jctb.2013.02.001zbMath1301.05199OpenAlexW1971711565MaRDI QIDQ744154

Ken-ichi Kawarabayashi, Gexin Yu

Publication date: 6 October 2014

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2013.02.001

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Connectivity (05C40)

Related Items (3)

Coloring graphs with forbidden minors ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ Minimum degree condition for a graph to be knitted

Cites Work

• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• An improved linear edge bound for graph linkages
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• On separating sets of edges in contraction-critical graphs
• Highly linked graphs
• Degree conditions for k‐ordered hamiltonian graphs
• An extremal problem for H‐linked graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture