Mixing 3-colourings in bipartite graphs

Authors:
Luis Cereceda;Jan Van den Heuvel;Matthew Johnson
Affiliations:
Centre for Discrete and Applicable Mathematics, Department of Mathematics, London School of Economics, London, UK;Centre for Discrete and Applicable Mathematics, Department of Mathematics, London School of Economics, London, UK;Department of Computer Science, Durham University, Science Laboratories, Durham, UK
Venue:
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Year:
2007

Citing 3
Cited 1

A very simple algorithm for estimating the number of k-colorings of a low-degree graph

Random Structures & Algorithms
Computational complexity of compaction to irreflexive cycles

Journal of Computer and System Sciences
Random sampling of 3-colorings in ℤ2

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the corresponding colourings differ on precisely one vertex of G. We consider the following question : given G, how easily can we decide whether or not C3(G) is connected?We show that the 3-colour graph of a 3-chromatic graph is never connected, and characterise the bipartite graphs for which C3(G) is connected. We also show that the problem of deciding the connectedness of the 3-colour graph of a bipartite graph is coNP-complete, but that restricted to planar bipartite graphs, the question is answerable in polynomial time.