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!)
A007084 Number of unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes without subgraphs R2 and R4.
(Formerly M3255)
1

%I M3255 #22 Oct 09 2017 02:31:07

%S 0,0,0,0,1,1,1,4,5,14,28,86,211,648,1878,5931,18326,58746,187620,

%T 608065,1975191,6461809,21212414

%N Number of unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes without subgraphs R2 and R4.

%C The graphs R2 and R4 are given on p. 281 of Holton. - _Sean A. Irvine_, Oct 09 2017

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

%H D. A. Holton et al., <a href="http://dx.doi.org/10.1016/0095-8956(85)90072-3">Hamiltonian cycles in cubic 3-connected bipartite planar graphs</a>, J. Combin. Theory, B 38 (1985), 279-297.

%Y Cf. A007083.

%K nonn,more

%O 2,8

%A _N. J. A. Sloane_, _Mira Bernstein_

%E Title improved, a(17) corrected and a(20)-a(24) from _Sean A. Irvine_, Oct 09 2017

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 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)