|
| |
|
|
A006797
|
|
A subclass of 2n-node trivalent planar graphs without triangles.
(Formerly M0899)
|
|
0
| |
|
|
1, 1, 0, 1, 2, 3, 9, 28, 97, 378, 1601, 7116
(list; graph; refs; listen; history; internal format)
|
|
|
|
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
| D. A. Holton and B. D. McKay, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combinat. Theory, B 45 (1988), 305-319.
|
|
|
CROSSREFS
| Sequence in context: A057248 A015960 A099079 * A144239 A139006 A153701
Adjacent sequences: A006794 A006795 A006796 * A006798 A006799 A006800
|
|
|
KEYWORD
| nonn,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
