✦ LIBER ✦
Deciding whether a planar graph has a cubic subgraph is NP-complete
✍ Scribed by Iain A. Stewart
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 505 KB
- Volume
- 126
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.