A Constructive Enumeration of Fullerenes

Journal of Algorithms

Volumn 23, Issue 2, 1997, Pages 345-358

  Brinkmann, Gunnar ^a   Dress, Andreas W M ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000798653     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0806     Document Type: Article

References (12)

1. D. Barnette, On generating planar graphs, Discrete Math. 7 (1974), 199-208.
2. G. Brinkmann, Generating cubic graphs faster than isomorphism checking, preprint, SFB 343 No. 92-047, Bielefeld, 1992.
3. G. Brinkmann and A. W. M. Dress, PentHex Puzzles - A reliable and efficient top-down approach to fullerene-structure enumeration, Proc. Nat. Acad. Sci., to appear.
4. G. Brinkmann, B. D. McKay, and C. Saager, The smallest cubic graphs of girth 9, Combin. Probab. Comput. 5 (1995), 1-13.
5. H. S. M. Coxeter, "Regular Polytopes," Dover, New York, 1973.
6. R. Grund, A. Kerber, and R. Laue, MOLGEN - ein Computeralgebrasystem für die Konstruktion molekularer Graphen, Match 27 (1992), 87-131.
7. 60: Buckminster-fullerene, Nature 318 (1985), 162-163.
8. X. Liu, D. J. Klein, T. G. Schmalz, and W. A. Seitz, Generation of carbon cage polyhedra, J. Comp. Chem. 12(10) (1991), 1252-1259.
9. 70, Chem. Phys. Lett. 181(2 3) (1991), 105-111.
10. B. D. McKay and G. F. Royle, Constructing the cubic graphs on up to 20 vertices, Ars Combin. 21 (1986), 129-140.
11. Chih-Han Sah, Combinatorial construction of fullerene structures, Croatica Chem. Acta (1993), 1-12.
12. E. Steinitz and H. Rademacher, "Vorlesungen über die Theorie der Polyeder," Berlin, 1934.