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

Robert Janczewski, Krzysztof Turowski. The computational complexity of the backbone coloring problem for planar graphs with connected backbones. Discrete Applied Mathematics, 184:237-242, 2015. [doi]

Abstract

Abstract is missing.