Deciding whether a planar graph has a cubic subgraph is NP-complete (Q1318823)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding whether a planar graph has a cubic subgraph is NP-complete |
scientific article |
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
