1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. T. Akiyama, T. Nishizeki and N. Saito, NP-completeness of the Hamiltonian cycle problem for bipartite graphs, J. Information Processing, 3, 2, pp. 73–76, 1980.
3. M. O. Albertson, A- lower bound for the independence number of a planar graph, J. Combinatorial Theory, Series B, 20, pp. 84–93, 1976.
4. M. O. Albertson, Finding an independent set in a planar graph, in “Graphs and Combinatorics,” ed., R. A. Bari and F. Harary, Springer-Verlag, Berlin-Heidelberg-New York: pp. 173–179, 1974.
5. K. Appel and W. Haken, Every planar map is four colourable, Part I: discharging, Illinois J. Math. 21, pp. 429–490, 1977.