A006797 A subclass of 2n-node trivalent planar graphs without triangles. (Formerly M0899)

1, 1, 0, 1, 2, 3, 9, 28, 97, 378, 1601, 7116

Offset

4,5

Comments

Number of cubic 3-connected planar non-hamiltonian triangle-free graphs with no essential 4-cuts or 3-cuts. - R. J. Mathar, Feb 08 2012

References

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=4..15.

D. A. Holton and B. D. McKay, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combinat. Theory B vol 45, iss. 3 (1988) 305-319.

D. A. Holton and B. D. McKay, Erratum, J. Combinat. Theory B vol 47, iss. 2 (1989) 248.

Crossrefs

Sequence in context: A015960 A099079 A339831 * A144239 A320951 A139006

Adjacent sequences: A006794 A006795 A006796 * A006798 A006799 A006800

Keyword

nonn,more

Author

N. J. A. Sloane.

Status

approved