List circular backbone colouring

Abstract : A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge. In the $q$-backbone colouring problem, these minimum distances are either $q$ or $1$, depending on whether or not the edge is in the {\em backbone}. In this paper we consider the list version of this problem, with particular focus on colours in $\Z_p$ -- this problem is closely related to the problem of circular choosability. We first prove that the {\em list circular $q$-backbone chromatic number} of a graph is bounded by a function of the list chromatic number. We then consider the more general problem in which each edge is assigned an individual distance between its endpoints, and provide bounds using the Combinatorial Nullstellensatz. Through this result and through structural approaches, we achieve good bounds when both the graph and the backbone belong to restricted families of graphs.
Type de document :
[Research Report] RR-8159, INRIA. 2012
Contributeur : Frederic Havet <>
Soumis le : vendredi 30 novembre 2012 - 19:22:30
Dernière modification le : mercredi 14 décembre 2016 - 01:03:31
Document(s) archivé(s) le : vendredi 1 mars 2013 - 03:58:29


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00759527, version 1



Frédéric Havet, Andrew King. List circular backbone colouring. [Research Report] RR-8159, INRIA. 2012. <hal-00759527>



Consultations de
la notice


Téléchargements du document