On a recolouring version of Hadwiger's conjecture

DOI10.1016/j.jctb.2023.10.001arXiv2103.10684MaRDI QIDQ6144404

Jonathan Narboni, Marc Heinrich, Marthe Bonamy, Clément Legrand-Duchesne

Publication date: 29 January 2024

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

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

zbMATH Keywords

colouringgraph minorreconfigurationHadwiger

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• Hadwiger numbers and over-dominating colourings
• Lower bound of the Hadwiger number of graphs by their average degree
• A note on transformations of edge colorings of bipartite graphs
• Kempe classes and the Hadwiger conjecture
• Les 5-colorations d'un graphe planaire forment une classe de commutation unique
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs
• The extremal function for \(K_{9}\) minors
• A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models
• Improved bounds for sampling colorings
• The complexity of change
• Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results
• An extremal function for contractions of graphs
• Contractions to k₈
• A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• A local epsilon version of Reed's conjecture
• A note on uniquely 10‐colorable graphs

This page was built for publication: On a recolouring version of Hadwiger's conjecture