The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637): Difference between revisions
From MaRDI portal
Latest revision as of 11:03, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones |
scientific article |
Statements
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (English)
0 references
9 December 2014
0 references
bounded-degree graphs
0 references
backbone chromatic number
0 references
graph algorithms
0 references