1. On generating planar graphs;Barnette;Discrete Math.,1974
2. G. Brinkmann, 1992, Generating cubic graphs faster than isomorphism checking
3. G. Brinkmann, A. W. M. Dress, PentHex Puzzles—A reliable and efficient top-down approach to fullerene-structure enumeration, Proc. Nat. Acad. Sci.
4. G. Brinkmann, B. D. McKay, C. Saager, 1995, The smallest cubic graphs of girth 9, Combin. Probab. Comput. 5, 1, 13
5. Regular Polytopes;Coxeter,1973