The maximum independent set problem for cubic planar graphs
- 1 May 1989
- Vol. 19 (3), 373-378
- https://doi.org/10.1002/net.3230190307
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An approximation algorithm for the maximum independent set problem in cubic planar graphsNetworks, 1986
- Approximation algorithms for NP-complete problems on planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsSIAM Journal on Computing, 1982
- Extremal bipartite subgraphs of cubic triangle-free graphsJournal of Graph Theory, 1982
- On maximum bipartite subgraphsJournal of Graph Theory, 1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- On some extremal problems in graph theoryIsrael Journal of Mathematics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965