OFFSET
4,2
COMMENTS
A polyhedral graph is irreducible if it ceases to be 3-connected upon removal of any edge. - Andrey Zabolotskiy, Feb 28 2024
REFERENCES
M. B. Dillencourt, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, J. Comb. Theory, Ser. B, 66 (1996) 87-122.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(13) from Dillencourt (1996) added by Andrey Zabolotskiy, Feb 28 2024
STATUS
approved