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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.