Complexity of conditional colouring with given template - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2014

Complexity of conditional colouring with given template

Résumé

We study partitions of the vertex set of a given graph into cells that each induce a subgraph in a given family, and for which edges can have ends in different cells only when those cells correspond to adjacent vertices of a fixed template graph H. For triangle-free templates, a general collection of graph families for which the partitioning problem can be solved in polynomial time is described. For templates with a triangle, the problem is in some cases shown to be NP-complete.
Fichier principal
Vignette du fichier
dmtcs-16-3-4.pdf (318.77 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-01188906 , version 1 (31-08-2015)

Identifiants

Citer

Peter J. Dukes, Steve Lowdon, Gary Macgillivray. Complexity of conditional colouring with given template. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 3 (3), pp.61--76. ⟨10.46298/dmtcs.2092⟩. ⟨hal-01188906⟩

Collections

TDS-MACS
37 Consultations
806 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More