An update on reconfiguring 10-colorings of planar graphs

DOI10.37236/9391zbMath1457.05033arXiv2002.05383OpenAlexW3115454632MaRDI QIDQ2223443

Carl Feghali, Zdeněk Dvořák

Publication date: 29 January 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

reconfiguration graph\(k\)-degenerate graph

Mathematics Subject Classification ID

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

Related Items (4)

Recoloring Planar Graphs of Girth at Least Five ⋮ List-recoloring of sparse graphs ⋮ Recoloring graphs of treewidth 2 ⋮ A Thomassen-type method for planar graph recoloring

Cites Work

• Unnamed Item
• Fast recoloring of sparse graphs
• Paths between colourings of sparse graphs
• Recoloring graphs via tree decompositions
• Paths between colourings of graphs with bounded tree-width
• Frozen colourings of bounded degree graphs
• Decomposing a planar graph into an independent set and a 3-degenerate graph
• Reconfiguring colorings of graphs with bounded maximum average degree
• Introduction to reconfiguration
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
• The complexity of change
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Toward Cereceda's conjecture for planar graphs

This page was built for publication: An update on reconfiguring 10-colorings of planar graphs