OFFSET
2,9
COMMENTS
These are the 4-regular graphs corresponding to the 3-regular fullerenes. Only the two smallest possible face sizes are allowed. The numbers up to a(33) have been checked by 2 independent programs. Further numbers have not been checked independently.
LINKS
Andrey Zabolotskiy, Table of n, a(n) for n = 2..70
G. Brinkmann, O. Heidemeier and T. Harmuth, The construction of cubic and quartic planar maps with prescribed face degrees, Discrete Applied Mathematics 128: 541-554, (2003).
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
Michel-Marie Deza, Mathieu Dutour Sikiric and Mikhail Ivanovitch Shtogrin, Geometric Structure of Chemistry-Relevant Graphs, Springer, 2015; see Sec. 4.4.
Mathieu Dutour Sikiric and Michel Deza, 4-regular and self-dual analogs of fullerenes, arXiv:0910.5323 [math.GT], 2009.
T. Tarnai, F. Kovács, P. W. Fowler and S. D. Guest, Wrapping the cube and other polyhedra, Proc. Roy. Soc. A 468(2145) (2012), 2652-2666. DOI: 10.1098/rspa.2012.0116.
EXAMPLE
From Allan Bickle, May 13 2024: (Start)
The smallest example (n=6) is the octahedron (only 3-gons).
For n=8, the unique graph is the square of an 8-cycle.
For n=9, the unique graph is the dual of the Herschel graph. (End)
CROSSREFS
KEYWORD
nonn
AUTHOR
Gunnar Brinkmann, Nov 07 2005
EXTENSIONS
Leading zeros prepended, terms a(34) and beyond added from the book by Deza et al. (except for a(60) from the paper by Brinkmann et al.) by Andrey Zabolotskiy, Oct 09 2021
STATUS
approved