login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243796 Number of graphs with n nodes that are chordal and Hamiltonian. 0
1, 0, 1, 2, 4, 15, 58, 360, 2793, 28761, 369545, 5914974, 116089531, 2816695796 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

We generated all biconnected chordal graphs up to 14 vertices using Brendan McKay's Nauty Software and Algorithms, then used a program we wrote to identify Hamiltonian graphs. - Philip Nelson, Ammon Hepworth, Raul A. Ramirez, Dec 16 2017

LINKS

Table of n, a(n) for n=1..14.

Ammon Hepworth, Philip Nelson, and Raul Ramirez, Hamiltonian Cycles

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version a1db88e

Brendan McKay's Nauty Software and Algorithms, nauty and Traces

CROSSREFS

Cf. A048192 (chordal graphs), A003216 (Hamiltonian graphs).

Sequence in context: A308345 A280065 A188228 * A153939 A112281 A316661

Adjacent sequences:  A243793 A243794 A243795 * A243797 A243798 A243799

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 27 2014

EXTENSIONS

a(11) added using tinygraph by Falk Hüffner, Aug 15 2017

a(12)-a(14) from Philip Nelson, Dec 16 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 11 18:50 EST 2019. Contains 329031 sequences. (Running on oeis4.)