On the Complexity of Covering Vertices by Faces in a Planar Graph
- 1 February 1988
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (1), 53-76
- https://doi.org/10.1137/0217004
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On the complexity of embedding planar graphs to minimize certain distance measuresAlgorithmica, 1990
- Send-and-Split Method for Minimum-Concave-Cost Network FlowsMathematics of Operations Research, 1987
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- Halin graphs and the travelling salesman problemMathematical Programming, 1983
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932