DeepAI AI Chat
Log In Sign Up

Towards Cereceda's conjecture for planar graphs

by   Eduard Eiben, et al.
University of Bergen

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 the colour of exactly one vertex. Cereceda conjectured ten years ago that, for every k-degenerate graph G on n vertices, R_k+2(G) has diameter O(n^2). The conjecture is wide open, with a best known bound of O(k^n), even for planar graphs. We improve this bound for planar graphs to 2^O(√(n)). Our proof can be transformed into an algorithm that runs in 2^O(√(n)) time.


page 1

page 2

page 3

page 4


Reconfiguring 10-colourings of planar graphs

Let k ≥ 1 be an integer. The reconfiguration graph R_k(G) of the k-colou...

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...

Constructions of betweenness-uniform graphs from trees

Betweenness centrality is a measure of the importance of a vertex x insi...

Parametric Shortest Paths in Planar Graphs

We construct a family of planar graphs (G_n: n≥ 1), where G_n has n vert...

Topological directions in Cops and Robbers

We present the first survey of its kind on results at the intersection o...

Results for the maximum weight planar subgraph problem

The problem of finding the maximum-weight, planar subgraph of a finite, ...

A Formal Disproof of the Hirsch Conjecture

The purpose of this paper is the formal verification of a counterexample...