5‐Coloring reconfiguration of planar graphs with no short odd cycles

DOI10.1002/jgt.23064arXiv2208.02228OpenAlexW4389382831MaRDI QIDQ6199387

Reem Mahmoud, Daniel W. Cranston

Publication date: 23 February 2024

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

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

zbMATH Keywords

graph coloringplanar graphsgraph diameterreconfiguration

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Mixing 3-colourings in bipartite graphs
• A Thomassen-type method for planar graph recoloring
• A polynomial version of Cereceda's conjecture
• Reconfiguring colorings of graphs with bounded maximum average degree
• Introduction to reconfiguration
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• Connectedness of the graph of vertex-colourings
• The complexity of change
• Recoloring Planar Graphs of Girth at Least Five

This page was built for publication: 5‐Coloring reconfiguration of planar graphs with no short odd cycles