login
A subclass of 2n-node trivalent planar graphs without triangles.
(Formerly M3470)
0

%I M3470 #10 Sep 26 2018 09:13:45

%S 1,1,4,13,58,279,1406,7525

%N A subclass of 2n-node trivalent planar graphs without triangles.

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

%H P. Flajolet and R. Schott, <a href="http://algo.inria.fr/flajolet/Publications/publist.html">Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series</a> In European Journal of Combinatorics, Vol. 11, 1990, pp. 412-432.

%H D. A. Holton and B. D. McKay, <a href="http://dx.doi.org/10.1016/0095-8956(88)90075-5">The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices</a>, J. Combinat. Theory B vol 45, iss. 3 (1988) 305-319.

%H D. A. Holton and B. D. McKay, <a href="http://dx.doi.org/10.1016/0095-8956(89)90025-7">Erratum</a>, J. Combinat. Theory B vol 47, iss. 2 (1989) 248.

%K nonn,more

%O 8,3

%A _N. J. A. Sloane_.