default search action
"Deciding whether a planar graph has a cubic subgraph is NP-complete."
Iain A. Stewart (1994)
- Iain A. Stewart:
Deciding whether a planar graph has a cubic subgraph is NP-complete. Discret. Math. 126(1-3): 349-357 (1994)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.