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

%I M0886 #12 Sep 26 2018 09:10:49

%S 2,3,8,22,77,285,1259,5863,29322,151308

%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 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 6,1

%A _N. J. A. Sloane_.