The graph genus problem is NP-complete
- 31 December 1989
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 10 (4) , 568-576
- https://doi.org/10.1016/0196-6774(89)90006-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Embeddings of graphs with no short noncontractible cyclesJournal of Combinatorial Theory, Series B, 1990
- An additivity theorem for the genus of a graphJournal of Combinatorial Theory, Series B, 1987