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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122113 Number of pairwise non-isomorphic 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 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". LINKS Table of n, a(n) for n=4..16. F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 9766535. EXAMPLE 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. CROSSREFS Cf. A007028. Sequence in context: A341045 A050881 A229719 * A093815 A142859 A259087 Adjacent sequences: A122110 A122111 A122112 * A122114 A122115 A122116 KEYWORD nonn,more AUTHOR Gordon F. Royle, Oct 18 2006 EXTENSIONS a(15)-a(16) added using tinygraph by Falk Hüffner, May 09 2019 STATUS approved

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.

Last modified May 31 16:24 EDT 2023. Contains 363068 sequences. (Running on oeis4.)