Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111)
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: Partition into cliques for cubic graphs: Planar case, complexity and approximation |
scientific article; zbMATH DE number 5348228
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partition into cliques for cubic graphs: Planar case, complexity and approximation |
scientific article; zbMATH DE number 5348228 |
Statements
Partition into cliques for cubic graphs: Planar case, complexity and approximation (English)
0 references
29 September 2008
0 references
NP-complete
0 references
Max SNP-hard
0 references
partition into cliques
0 references
coloring
0 references
approximation
0 references
cubic planar graphs
0 references
