Backbone colouring: Tree backbones with small diameter in planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2013

Backbone colouring: Tree backbones with small diameter in planar graphs

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.
Fichier principal
Vignette du fichier
BBCdiam2.pdf (352.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More