A122113 Number of pairwise non-isomorphic biconnected planar bipartite graphs on n vertices.

1, 1, 4, 6, 28, 77, 386, 1787, 10354, 62040, 404093, 2725484, 19078248

Offset: 4

Author

Gordon F. Royle, Oct 18 2006

Keywords

• nonn
• more

Comments

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

Examples

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

Links

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

Crossrefs

Cf. A007028.

Extensions

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