The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517)
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 NP-completeness of (1,r)-subcolorability of cubic graphs |
scientific article; zbMATH DE number 1767421
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of (1,r)-subcolorability of cubic graphs |
scientific article; zbMATH DE number 1767421 |
Statements
The NP-completeness of (1,r)-subcolorability of cubic graphs (English)
0 references
14 July 2002
0 references
Cubic graph
0 references
Planar graph
0 references
Subcoloring
0 references
Computational complexity
0 references
Combinatorial problem
0 references
0.89901084
0 references
0.8968452
0 references
0.89446056
0 references
0.89049566
0 references
0.8899956
0 references
0.88523173
0 references
0.8846006
0 references
0 references
