Pages that link to "Item:Q477637"

The following pages link to The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637):

Displaying 2 items.

• On the hardness of computing span of subcubic graphs (Q888955) (← links)
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)