Next Article in Journal
A Distributed Indexing Method for Timeline Similarity Query
Next Article in Special Issue
Introduction to Reconfiguration
Previous Article in Journal
On Hierarchical Text Language-Identification Algorithms
Previous Article in Special Issue
Vertex Cover Reconfiguration and Beyond
Article Menu

Export Article

Open AccessFeature PaperArticle
Algorithms 2018, 11(4), 40; doi:10.3390/a11040040

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs

1
Department of Mathematics, University of Hawaii at Manoa, Honolulu, HI 96822, USA
2
Smith College, Northampton, MA 01063, USA
3
Department of Mathematics and Statistics, University of Victoria, Victoria, BC V8W 2Y2, Canada
*
Author to whom correspondence should be addressed.
Received: 12 February 2018 / Revised: 23 March 2018 / Accepted: 24 March 2018 / Published: 29 March 2018
(This article belongs to the Special Issue Reconfiguration Problems)
View Full-Text   |   Download PDF [324 KB, uploaded 29 March 2018]   |  

Abstract

A k-colouring of a graph G with colours 1 , 2 , , k is canonical with respect to an ordering π = v 1 , v 2 , , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 c k , whenever colour c is assigned to a vertex v i , each colour less than c has been assigned to a vertex that precedes v i in π . The canonical k-colouring graph of G with respect to π is the graph Can k π ( G ) with vertex set equal to the set of canonical k-colourings of G with respect to π , with two of these being adjacent if and only if they differ in the colour assigned to exactly one vertex. Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs is studied. It is shown that for complete multipartite graphs, and bipartite graphs there exists a vertex ordering π such that Can k π ( G ) is connected for large enough values of k. It is proved that a canonical colouring graph of a complete multipartite graph usually does not have a Hamilton cycle, and that there exists a vertex ordering π such that Can k π ( K m , n ) has a Hamilton path for all k 3 . The paper concludes with a detailed consideration of Can k π ( K 2 , 2 , , 2 ) . For each k χ and all vertex orderings π , it is proved that Can k π ( K 2 , 2 , , 2 ) is either disconnected or isomorphic to a particular tree. View Full-Text
Keywords: reconfiguration problems; graph colouring; Hamilton cycles; Gray codes reconfiguration problems; graph colouring; Hamilton cycles; Gray codes
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Haas, R.; MacGillivray, G. Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms 2018, 11, 40.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top