DeepAI AI Chat
Log In Sign Up

Reconfiguring 10-colourings of planar graphs

by   Carl Feghali, et al.
University of Bergen

Let k ≥ 1 be an integer. The reconfiguration graph R_k(G) of the k-colourings of a graph G has as vertex set the set of all possible k-colourings of G and two colourings are adjacent if they differ on exactly one vertex. A conjecture of Cereceda from 2007 asserts that for every integer ℓ≥ k + 2 and k-degenerate graph G on n vertices, R_ℓ(G) has diameter O(n^2). The conjecture has been verified only when ℓ≥ 2k + 1. We give a simple proof that if G is a planar graph on n vertices, then R_10(G) has diameter at most n^2. Since planar graphs are 5-degenerate, this affirms Cereceda's conjecture for planar graphs in the case ℓ = 2k.


page 1

page 2

page 3

page 4


Towards Cereceda's conjecture for planar graphs

The reconfiguration graph R_k(G) of the k-colourings of a graph G has as...

A polynomial version of Cereceda's conjecture

Let k and d be such that k > d+2. Consider two k-colourings of a d-degen...

Strengthening a theorem of Meyniel

For an integer k ≥ 1 and a graph G, let 𝒦_k(G) be the graph that has ver...

Jones' Conjecture in subcubic graphs

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic ...

A short proof of the middle levels theorem

Consider the graph that has as vertices all bitstrings of length 2n+1 wi...

Three-chromatic geometric hypergraphs

We prove that for any planar convex body C there is a positive integer m...

List recoloring of planar graphs

A list assignment L of a graph G is a function that assigns to every ver...