The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A326206 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A326206

Number of n-vertex labeled simple graphs containing a Hamiltonian path.
(history; published version)

#14 by Michael De Vlieger at Wed Aug 23 08:43:25 EDT 2023

STATUS

proposed

approved

#13 by Michel Marcus at Wed Aug 23 04:50:59 EDT 2023

STATUS

editing

proposed

#12 by Michel Marcus at Wed Aug 23 04:50:56 EDT 2023

LINKS

Gus Wiseman, <a href="http://arxiv.org/abs/0709.0430">Enumeration of paths and cycles and e-coefficients of incomparability graphs</a>, arXiv:0709.0430 [math.CO], 2007.

STATUS

approved

editing

#11 by Alois P. Heinz at Fri Jun 21 07:55:00 EDT 2019

STATUS

proposed

approved

#10 by Falk Hüffner at Fri Jun 21 07:48:36 EDT 2019

STATUS

editing

proposed

#9 by Falk Hüffner at Fri Jun 21 07:48:30 EDT 2019

DATA

0, 0, 1, 4, 34, 633, 23368, 1699012, 237934760, 64558137140, 34126032806936, 35513501049012952

LINKS

F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535.

EXTENSIONS

a(7)-a(11) added using tinygraph by Falk Hüffner, Jun 21 2019

STATUS

approved

editing

#8 by Susanna Cuyler at Sat Jun 15 20:50:47 EDT 2019

STATUS

proposed

approved

#7 by Gus Wiseman at Sat Jun 15 19:42:06 EDT 2019

STATUS

editing

proposed

#6 by Gus Wiseman at Sat Jun 15 19:38:29 EDT 2019

CROSSREFS

Simple graphs with a Hamiltonian cycle are A003216A326208.

Cf. A003216, A006125, A057864, A283420, A326208.

#5 by Gus Wiseman at Sat Jun 15 19:30:45 EDT 2019

CROSSREFS

The directed case for digraphs is A326214 (with loops) or A326217 (without loops).

Simple graphs without a Hamiltonian path are counted by A326205.

Simple graphs with a Hamiltonian cycle are A003216.

Cf. A003216, A006125, A057864, A283420, A326208.