OFFSET
2,7
COMMENTS
Also the number of species of spherical Latin bi-trades of size n. - Ian Wanless, Oct 08 2007
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Gunnar Brinkmann and Brendan D. McKay, Fast generation of planar graphs, MATCH Commun. Math. Comput. Chem., 58 (2007) 323-357.
Gunnar Brinkmann and Brendan D. McKay, Guide to using plantri (version 4.1).
Gunnar Brinkmann and Brendan D. McKay, Guide to using plantri. [Cached copy, with permission.]
Nicholas Cavenagh and Petr Lisoněk, Planar Eulerian triangulations are equivalent to spherical latin bitrades, J. Combin. Theory Ser. A 115 (2008), no. 1, 193-197.
CombOS - Combinatorial Object Server, generate planar graphs.
Aleš Drápal, Carlo Hämäläinen, and Dan Rosendorf, An enumeration of spherical latin bitrades, arXiv:0907.1376 [math.CO], Sep 16 2009.
Derek A. Holton, Bennet Manvel, and Brendan D. McKay, Hamiltonian cycles in cubic 3-connected bipartite planar graphs, J. Combin. Theory, B 38 (1985), 279-297.
Irene Sciriha and Patrick W. Fowler, Nonbonding Orbitals in Fullerenes: Nuts and Cores in Singular Polyhedral Graphs, J. Chem. Inf. Model. 47(5) (2007) 1763-1775.
Shobhna Singh, Constrained models in aperiodic systems, Ph. D. Thesis, Cardiff Univ. (Wales 2025). See p. 51.
I. M. Wanless, A computer enumeration of small latin trades, Australas. J. Combin. 39, (2007) 247-258.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
Description and initial terms corrected by Gordon Royle, Feb 15 1999
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 07 2010
STATUS
approved
