Reconfiguring 10-colourings of planar graphs

DOI10.1007/s00373-020-02199-0zbMath1462.05137arXiv1902.02278OpenAlexW3031641564MaRDI QIDQ2657051

Carl Feghali

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

vertex coloringplanar graphreconfiguration graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (max. 100)

A polynomial version of Cereceda's conjecture ⋮ Reconfiguring colorings of graphs with bounded maximum average degree ⋮ A Thomassen-type method for planar graph recoloring

Cites Work

• Fast recoloring of sparse graphs
• Every planar graph is 5-choosable
• Paths between colourings of sparse graphs
• Recoloring graphs via tree decompositions
• Paths between colourings of graphs with bounded tree-width
• 3-list-coloring planar graphs of girth 5
• Introduction to reconfiguration
• A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
• The complexity of change
• Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
• Toward Cereceda's conjecture for planar graphs
• List coloring with requests

This page was built for publication: Reconfiguring 10-colourings of planar graphs