The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones

Robert Janczewski, Krzysztof Turowski. The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. Inf. Process. Lett., 115(2):232-236, 2015. [doi]

Authors

Robert Janczewski

This author has not been identified. Look up 'Robert Janczewski' in Google

Krzysztof Turowski

This author has not been identified. Look up 'Krzysztof Turowski' in Google