Mixing 3-colourings in bipartite graphs

Cereceda, L, van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Johnson, M (2007) Mixing 3-colourings in bipartite graphs. . London School of Economics and Political Science, London, UK.

Full text not available from this repository.

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.

Item Type:	Monograph (Report)
Official URL:	http://www.cdam.lse.ac.uk/Reports/
Additional Information:	© 2007 London school of economics and political science
Divisions:	Mathematics
Subjects:	H Social Sciences > H Social Sciences (General)
Date Deposited:	10 Jul 2008 09:27
Last Modified:	12 Dec 2024 05:45
URI:	http://eprints.lse.ac.uk/id/eprint/6781

Actions (login required)

View Item