Chiba, Norishige; Nishizeki, Takao; Saito, Nobuji An algorithm for finding a large independent set in planar graphs. (English) Zbl 0507.68040 Networks 13, 247-252 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science PDFBibTeX XMLCite \textit{N. Chiba} et al., Networks 13, 247--252 (1983; Zbl 0507.68040) Full Text: DOI References: [1] , and , The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974). [2] Albertson, J. Combinatorial Theory Ser. B 20 pp 84– (1976) [3] Finding an independent set in a planar graph. In Graphs and Combinatorics. and , Eds. Springer, Berlin (1974) 173–179. [4] Appel, Illinois J. Math. 21 pp 429– (1977) [5] Chiba, SIAM J. Comput. [6] Chiba, J. Algorithms 2 pp 317– (1981) [7] Hopcroft, J. Assoc. Comput. Mach. 21 pp 549– (1974) · Zbl 0307.68025 · doi:10.1145/321850.321852 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.