login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319425 Number of cyclically 3-connected cubic planar graphs without triangles and containing 2n nodes. 2

%I #6 Sep 26 2018 15:30:02

%S 1,7,26,146,776

%N Number of cyclically 3-connected cubic planar graphs without triangles and containing 2n nodes.

%H R. E. L. Aldred, S. Bau, D. A. Holton, <a href="https://doi.org/10.1137/S0895480198348665">Nonhamiltonian 3-connected cubic planar graphs</a>, SIAM Journal on Discrete Mathematics, 13(1) (2000), 25-32. See Table 1.

%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.

%Y Cf. A319426, A319427.

%K nonn,more

%O 12,2

%A _N. J. A. Sloane_, Sep 26 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 10:19 EDT 2024. Contains 373543 sequences. (Running on oeis4.)