The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.018 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045373821 / rank | |||
Normal rank |
Revision as of 03:15, 20 March 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