An algorithm for finding a large independent set in planar graphs
- 1 June 1983
- Vol. 13 (2) , 247-252
- https://doi.org/10.1002/net.3230130209
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- A lower bound for the independence number of a planar graphJournal of Combinatorial Theory, Series B, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Finding an independent set in a planar graphPublished by Springer Nature ,1974