|
%I #28 Dec 28 2017 01:31:25
%S 1,0,1,2,4,15,58,360,2793,28761,369545,5914974,116089531,2816695796
%N Number of graphs with n nodes that are chordal and Hamiltonian.
%C 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
%H Ammon Hepworth, Philip Nelson, and Raul Ramirez, <a href="https://github.com/Sailanarmo/HamiltonianCycles">Hamiltonian Cycles</a>
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version a1db88e
%H Brendan McKay's Nauty Software and Algorithms, <a href="http://pallini.di.uniroma1.it">nauty and Traces</a>
%Y Cf. A048192 (chordal graphs), A003216 (Hamiltonian graphs).
%K nonn,more
%O 1,4
%A _Travis Hoppe_ and _Anna Petrone_, Jun 27 2014
%E a(11) added using tinygraph by _Falk Hüffner_, Aug 15 2017
%E a(12)-a(14) from _Philip Nelson_, Dec 16 2017
|
