The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones |
scientific article; zbMATH DE number 6378661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones |
scientific article; zbMATH DE number 6378661 |
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
0.9050484299659728
0 references
0.9049980044364928
0 references
0.8865128755569458
0 references
0.8670285940170288
0 references
0.8596834540367126
0 references
