|
Search: id:A001186
|
|
|
| A001186 |
|
Number of cubic Hamiltonian graphs with 2n nodes. |
|
+0
1
|
| |
|
|
OFFSET
|
2,2
|
|
|
REFERENCES
|
McKay, Brendan D.; Royle, Gordon F.; Constructing the cubic graphs on up to 20 vertices. Thirteenth Australasian conference on combinatorial mathematics and computing (Sydney, 1985). Ars Combin. 21 (1986), A, 129-140.
|
|
LINKS
|
Roman Maurer, Counting small hamiltonian cubic graphs.
|
|
CROSSREFS
|
Sequence in context: A014288 A020096 A054499 this_sequence A125282 A020125 A076322
Adjacent sequences: A001183 A001184 A001185 this_sequence A001187 A001188 A001189
|
|
KEYWORD
|
nonn,hard,nice
|
|
AUTHOR
|
Martin Harborth (Martin.Harborth(AT)vt.siemens.de)
|
|
EXTENSIONS
|
One more term from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 02 2007
|
|
|
Search completed in 0.002 seconds
|
