1. Nonhamiltonian 3-connected cubic planar graphs;Aldred;SIAM J. Discrete Math.,2000
2. On generating planar graphs;Barnette;Discrete Math.,1974
3. V. Batagelj, An inductive definition of the class of all triangulations with no vertex of degree smaller than 5, in: Proceedings of the Fourth Yugoslav Seminar on Graph Theory, Novi Sad, 1983.
4. A constructive enumeration of fullerenes;Brinkmann;J. Algorithms,1997
5. G. Brinkmann, B.D. McKay, Programs plantri and fullgen, available at 〈http://cs.anu.edu.au/~bdm/plantri〉.