|
Search: id:A021103
|
|
|
| A021103 |
|
Number of two-connected (or biconnected) planar graphs with n nodes. |
|
+0
6
|
|
| 0, 0, 1, 1, 3, 9, 44, 294, 2893, 36496, 545808, 9029737, 159563559, 2952794985, 56589742050
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
A. Gagarin, G. Labelle, P. Leroux and T. Walsh, Structure and enumeration of two-connected graphs with prescribed three-connected components Advances in Applied Mathematics, (2009), to appear. [From Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009]
|
|
CROSSREFS
|
Cf. A005142, A049336.
Sequence in context: A108239 A028858 A058106 this_sequence A001902 A068100 A012821
Adjacent sequences: A021100 A021101 A021102 this_sequence A021104 A021105 A021106
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Brendan McKay (bdm(AT)cs.anu.edu.au)
|
|
EXTENSIONS
|
3 more terms from Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009
|
|
|
Search completed in 0.002 seconds
|
