(Circular) backbone colouring: forest backbones in planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2014

(Circular) backbone colouring: forest backbones in planar graphs


Consider an undirected graph $G$ and a subgraph $H$ of $G$, on the same vertex set. The {\it $q$-backbone chromatic number} $\BBC_q(G,H)$ is the minimum $k$ such that $G$ can be properly coloured with colours from $\{1, \dots, k\}$, and moreover for each edge of $H$, the colours of its ends differ by at least $q$. In this paper we focus on the case when $G$ is planar and $H$ is a forest. We give a series of NP-hardness results as well as upper bounds for $\BBC_q(G,H)$, depending on the type of the forest (matching, galaxy, spanning tree). Eventually, we discuss a circular version of the problem.
Fichier principal
Vignette du fichier
complexity-backbone.pdf (321.12 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00957243 , version 1 (23-10-2016)



Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca. (Circular) backbone colouring: forest backbones in planar graphs. Discrete Applied Mathematics, 2014, 169, pp.119-134. ⟨10.1016/j.dam.2014.01.011⟩. ⟨hal-00957243⟩
277 View
146 Download



Gmail Mastodon Facebook X LinkedIn More