Deciding whether a planar graph has a cubic subgraph is NP-complete (Q1318823)
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: Deciding whether a planar graph has a cubic subgraph is NP-complete |
scientific article; zbMATH DE number 540949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding whether a planar graph has a cubic subgraph is NP-complete |
scientific article; zbMATH DE number 540949 |
Statements
Deciding whether a planar graph has a cubic subgraph is NP-complete (English)
0 references
4 April 1994
0 references
planar graph
0 references
cubic subgraph
0 references
NP-complete
0 references
0.8804055
0 references
0.8804055
0 references
0.8753082
0 references
0.8718883
0 references
0.8592565
0 references
0 references
0.8569286
0 references
0.8563471
0 references
