# Backbone colouring: Tree backbones with small diameter in planar graphs

2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Given a graph $G$ and a spanning subgraph $T$ of $G$, a backbone $k$-coloring for $(G,T)$ is a mapping $c:V(G)\to\{1,\ldots,k\}$ such that $|c(u)-c(v)|\geq 2$ for every edge $uv\in E(T)$ and $|c(u)-c(v)|\geq 1$ for every edge $uv\in E(G)\setminus E(T)$. The backbone chromatic number $\chi_{bb}(G,T)$ is the smallest integer $k$ such that there exists a backbone $k$-coloring of $(G,T)$. In 2007, Broersma et al. \cite{BFG+07} conjectured that $\chi_{bb}(G,T)\leq 6$ for every planar graph $G$ and every spanning tree $T$ of $G$. In this paper, we prove this conjecture when $T$ has diameter at most four.
Document type :
Journal articles

Cited literature [10 references]

https://hal.inria.fr/hal-00821608
Contributor : Frederic Havet Connect in order to contact the contributor
Submitted on : Sunday, October 23, 2016 - 4:09:07 PM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM

### File

BBCdiam2.pdf
Files produced by the author(s)

### Citation

Victor Campos, Frédéric Havet, Rudini Sampaio, Ana Silva. Backbone colouring: Tree backbones with small diameter in planar graphs. Theoretical Computer Science, Elsevier, 2013, 487, pp.50-64. ⟨10.1016/j.tcs.2013.03.003⟩. ⟨hal-00821608⟩

Record views