Pages that link to "Item:Q477637"
From MaRDI portal
The following pages link to The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637):
Displayed 1 item.
The following pages link to The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637):
Displayed 1 item.