

A122113


Number of pairwise nonisomorphic biconnected planar bipartite graphs on n vertices.


0



1, 1, 4, 6, 28, 77, 386, 1787, 10354, 62040, 404093, 2725484, 19078248
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

4,3


COMMENTS

Biconnected means "at least 2connected". The corresponding sequence for 3connected bipartite planar graph is A007028, where the term "polyhedral graph" is used as shorthand for "3connected planar graph".


LINKS

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 9766535.


EXAMPLE

a(4) = 1 because the 4cycle is the only planar and bipartite graph on 4 vertices that is at least 2connected and a(5) = 1 because the complete bipartite graph K2,3 is the only such graph on 5 vertices.


CROSSREFS



KEYWORD

nonn,more


AUTHOR



EXTENSIONS

a(15)a(16) added using tinygraph by Falk Hüffner, May 09 2019


STATUS

approved



