|
Search: id:A086216
|
|
|
| A086216 |
|
Number of 4-connected graphs on n nodes. |
|
+0
1
|
| |
|
|
OFFSET
|
5,2
|
|
|
LINKS
|
Eric Weisstein's World of Mathematics, k-Connected Graph
|
|
EXAMPLE
|
There are 4 different 4-connected graphs on 6 vertices. - Dylan Thurston (dpt(AT)cpw.math.columbia.edu), Jun 18 2009
|
|
CROSSREFS
|
Sequence in context: A144281 A058791 A093959 this_sequence A167041 A123129 A075577
Adjacent sequences: A086213 A086214 A086215 this_sequence A086217 A086218 A086219
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), Jul 12, 2003
|
|
EXTENSIONS
|
Offset corrected by Dylan Thurston, Jun 18 2009
|
|
|
Search completed in 0.002 seconds
|
