On the diameter of reconfiguration graphs for vertex colourings

Marthe Bonamy 1, * Matthew Johnson 2 Ioannis Lignos 2 Viresh Patel 2 Daniël Paulusma 2
* Auteur correspondant
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The reconfiguration graph of the k-colourings of a graph G contains as its vertex set the proper vertex k-colourings of G, and two colourings are joined by an edge in the reconfiguration graph if they differ in colour on just one vertex of G. We prove that for a graph G on n vertices that is chordal or chordal bipartite, if G is k-colourable, then the reconfiguration graph of its l-colourings, for l>=k+1, is connected and has diameter O(n^2). We show that this bound is asymptotically tight up to a constant factor.
Type de document :
Communication dans un congrès
EuroComb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. Elsevier, pp.161-166, 2011, Electronic Notes in Discrete Mathematics
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00782875
Contributeur : Marthe Bonamy <>
Soumis le : mercredi 30 janvier 2013 - 17:22:22
Dernière modification le : jeudi 19 juillet 2018 - 16:58:09
Document(s) archivé(s) le : lundi 17 juin 2013 - 17:49:10

Fichier

EuroComb_11_paper177.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-00782875, version 1

Collections

Citation

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma. On the diameter of reconfiguration graphs for vertex colourings. EuroComb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. Elsevier, pp.161-166, 2011, Electronic Notes in Discrete Mathematics. 〈lirmm-00782875〉

Partager

Métriques

Consultations de la notice

192

Téléchargements de fichiers

253