Kempe equivalent list edge-colorings of planar graphs

DOI10.1016/j.disc.2022.113180zbMath1527.05063arXiv2110.06191OpenAlexW3207283458MaRDI QIDQ6091809

Daniel W. Cranston

Publication date: 27 November 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

edge-coloringplanar graphschoosabilitydischarginglist-coloringKempe swaps

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
• Reconfiguration of list edge-colorings in a graph
• Kempe classes and the Hadwiger conjecture
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• List edge and list total colourings of multigraphs
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs
• Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs
• Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
• Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results
• Kempe equivalence of colourings of cubic graphs

This page was built for publication: Kempe equivalent list edge-colorings of planar graphs