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)...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 184; s. 237 - 242
Hlavní autori:	Janczewski, Robert, Turowski, Krzysztof
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.03.2015
Predmet:	Algorithms Approximation Backbone Backbone chromatic number Cacti Coloring Complexity Computation Graphs Planar graphs Backbone chromatic number Planar graphs Cacti
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!