A separator theorem for graphs of bounded genus
- 3 September 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (3) , 391-407
- https://doi.org/10.1016/0196-6774(84)90019-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the Problem of Partitioning Planar GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- On the independence ratio of a graphJournal of Graph Theory, 1978
- Additivity of the genus of a graphBulletin of the American Mathematical Society, 1962