The computational complexity of the backbone coloring problem for planar graphs with connected backbones

In the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance:A simple planar graph G, its connected spanning subgraph (backbone)...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 184; pp. 237 - 242
Main Authors:	Janczewski, Robert, Turowski, Krzysztof
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.03.2015
Subjects:	Algorithms Approximation Backbone Backbone chromatic number Cacti Coloring Complexity Computation Graphs Planar graphs Backbone chromatic number Planar graphs Cacti
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!