The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of (1,r)-subcolorability of cubic graphs |
scientific article |
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
