|
Search: id:A096330
|
|
|
| A096330 |
|
Number of 3-connected planar graphs on n labeled nodes. |
|
+0
1
|
| |
|
|
OFFSET
|
4,2
|
|
|
COMMENT
|
Recurrence known, see Bodirsky et al.
|
|
REFERENCES
|
M. Bodirsky, C. Groepl and M. Kang: Generating Labeled Planar Graphs Uniformly At Random; ICALP03 Eindhoven, LNCS 2719, Springer Verlag (2003), 1095 - 1107.
|
|
CROSSREFS
|
Cf. A066537.
Sequence in context: A012809 A014769 A012851 this_sequence A042203 A042200 A104593
Adjacent sequences: A096327 A096328 A096329 this_sequence A096331 A096332 A096333
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
S. R. Finch (Steven.Finch(AT)inria.fr), Aug 02 2004
|
|
|
Search completed in 0.002 seconds
|
