A034889 - OEIS

A034889

Number of embeddings on the sphere of 2-connected planar graphs with n nodes.

1, 3, 10, 61, 564, 7593, 123874, 2262877, 44190279, 904777809, 19207129217, 419870351012, 9405626692325

(list; graph; refs; listen; history; text; internal format)

OFFSET

3,2

COMMENTS

The complete graph on two vertices is sometimes considered to be 2-connected (or nonseparable). Compare A002218 with A021103. - Andrew Howroyd, Mar 01 2021

REFERENCES

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

LINKS

Table of n, a(n) for n=3..15.

G. Brinkmann and B. D. McKay, Fast generation of planar graphs, MATCH Commun. Math. Comput. Chem, 58 (2007), 323-357. [Expanded version]

Eric Weisstein's World of Mathematics, Planar Embedding.

CROSSREFS

Row sums of A342060.

Cf. A002218, A005142, A021103.

Sequence in context: A156075 A330624 A228773 * A260969 A305853 A160921

Adjacent sequences: A034886 A034887 A034888 * A034890 A034891 A034892

KEYWORD

nonn,nice,more,changed

AUTHOR

Ronald C. Read

EXTENSIONS

a(8)-a(15) added by Mohammadreza Jooyandeh, Sep 03 2013

STATUS

approved