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

Given a graph G, a spanning subgraph H of G and an integer λ≥2, a λ-backbone coloring of G with backbone H is a proper vertex coloring of G using colors 1,2,…, in which the color difference between vertices adjacent in H is greater than or equal to λ. The backbone coloring problem is that of finding...

Ausführliche Beschreibung