The Generation of Fullerenes

Abstract

We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes -- fullgen -- and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers of fullerenes and IPR fullerenes up to 400 vertices. We also check up to 316 vertices a conjecture of Barnette that cubic planar graphs with maximum face size 6 are hamiltonian and verify that the smallest counterexample to the spiral conjecture has 380 vertices.

21 pages; added a note

Cited by in corpus (11)

• House of Graphs 2.0: a database of interesting graphs and more
• Recursive generation of IPR fullerenes
• Finite sets of operations sufficient to construct any fullerene from $C_{20}$
• Exact square coloring of subcubic planar graphs
• Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
• Generation and properties of nut graphs
• Geometric Biplane Graphs I: Maximal Graphs
• Fullerenes with distant pentagons
• The set of vertices with positive curvature in a planar graph with nonnegative curvature
• Polyhedra with hexagonal and triangular faces and three faces around each vertex
• Automated Conjecturing VII: The Graph Brain Project & Big Mathematics