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

DOI10.1016/J.JCTB.2013.02.001zbMATH Open1301.05199OpenAlexW1971711565MaRDI QIDQ744154FDOQ744154

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

Recommendations

• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• Minimum degree condition for a graph to be knitted
• Hadwiger's conjecture for the complements of Kneser graphs
• Matchings and Hadwiger's conjecture
• Connectivity and choosability of graphs with no \(K_t\) minor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Minimum degree condition for a graph to be knitted
• Coloring graphs with forbidden minors
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• An improved linear connectivity bound for tournaments to be highly linked

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744154)