Finding a maximum-genus graph imbedding
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 35 (3) , 523-534
- https://doi.org/10.1145/44483.44485
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient algorithms for graphic matroid intersection and parityPublished by Springer Nature ,2005
- Hierarchy for imbedding‐distribution invariants of a graphJournal of Graph Theory, 1987
- An augmenting path algorithm for linear matroid parityCombinatorica, 1986
- An algorithm for imbedding cubic graphs in the torusJournal of Computer and System Sciences, 1980
- A Linear Time Planarity Algorithm for 2-ComplexesJournal of the ACM, 1979
- Upper-embeddable graphs and related topicsJournal of Combinatorial Theory, Series B, 1979
- Efficient Planarity TestingJournal of the ACM, 1974
- On the maximum genus of a graphJournal of Combinatorial Theory, Series B, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Ueber das Problem der NachbargebieteMathematische Annalen, 1891