Unique Colorability and Clique Minors

DOI10.1002/jgt.22056zbMath1368.05052arXiv1508.01396OpenAlexW2963003558MaRDI QIDQ5272642

Matthias Kriesell

Publication date: 30 June 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Hadwiger conjectureclique minorKempe coloring

Mathematics Subject Classification ID

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

Related Items

Characterising graphs with no subdivision of a wheel of bounded diameter ⋮ A note on uniquely 10‐colorable graphs ⋮ Uniquely colorable graphs up to automorphisms ⋮ Rooted complete minors in line graphs with a Kempe coloring ⋮ Maximal ambiguously \(k\)-colorable graphs

Cites Work

• Unnamed Item
• Rooted \(K_4\)-minors
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• A note on alternating cycles in edge-coloured graphs
• A special case of Hadwiger's conjecture
• Some Homeomorphism Properties of Graphs