1. Every planar map is four colourable, Part I: discharging;Appel;Illinois J. Math.,1977
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs;Asano;Discrete Appl. Math.,1984
4. Finding an independent set in a planar graph;Albertson,1974
5. A lower bound for the independence number of a planar graph;Albertson;J. Combinatorial Theory (B),1976