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!)
A006795 A subclass of 2n-node trivalent planar graphs without triangles.
(Formerly M1936)
0

%I M1936 #11 Sep 26 2018 09:11:12

%S 1,2,9,43,212,1115,6156,34693,199076

%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 7,2

%A _N. J. A. Sloane_.

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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)