EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

16580 λ-backbone colorings along pairwise disjoint stars and matchings

Home Policy Brochure Browse Search User Area Contact Help

Broersma, H.J. and Fujisawa, J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. and Yoshimoto, K. (2009) λ-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics, 309 (18). pp. 5596-5609. ISSN 0012-365X *** ISI Impact 0,548 ***

Full text available as:

PDF

- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1096 Kb

Official URL: http://dx.doi.org/10.1016/j.disc.2008.04.007

Abstract

Given an integer $\lambda \ge 2$ , a graph $G=(V,E)$ and a spanning subgraph $H$ of $G$ (the backbone of $G$ ), a $\lambda$ -backbone coloring of $(G,H)$ is a proper vertex coloring $V\to\{1,2,\ldots\}$ of $G$ , in which the colors assigned to adjacent vertices in $H$ differ by at least $\lambda$ . We study the case where the backbone is either a collection of pairwise disjoint stars or a matching. We show that for a star backbone $S$ of $G$ the minimum number $\ell$ for which a $\lambda$ -backbone coloring of $(G,S)$ with colors in $\{1,\ldots,\ell\}$ exists can roughly differ by a multiplicative factor of at most $2-{1\over \lambda}$ from the chromatic number $\chi(G)$ . For the special case of matching backbones this factor is roughly $2-{2\over\lambda +1}$ . We also show that the computational complexity of the problem “Given a graph $G$ with a star backbone $S$ , and an integer $\ell$ , is there a $\lambda$ -backbone coloring of $(G,S)$ with colors in $\{1,\ldots,\ell\}$ ?? jumps from polynomially solvable to NP-complete between $\ell=\lambda+1$ and $\ell =\lambda+2$ (the case $\ell=\lambda+2$ is even NP-complete for matchings). We finish the paper by discussing some open problems regarding planar graphs.

Item Type:	Article
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:	CTIT-IE&ICT: Industrial Engineering and ICT
ID Code:	16580
Status:	Published
Deposited On:	30 November 2009
Refereed:	Yes
International:	Yes
ISI Impact Factor:	0,548
More Information:	statistics metis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item