A362907 Number of graphs on n unlabeled nodes with treewidth 3.

0, 0, 0, 0, 1, 6, 53, 501, 5889, 81786

Offset

0,6

Links

Table of n, a(n) for n=0..9.

Wikipedia, Treewidth.

Example

There is a single graph of treewidth 3 on 4 vertices, which is the complete graph.

Prog

(SageMath) [sum(1 for g in graphs(n) if g.treewidth() == 3) for n in range(9)]

Crossrefs

Column k=3 of A263294.

Sequence in context: A027835 A055973 A223345 * A369506 A066357 A276365

Adjacent sequences: A362904 A362905 A362906 * A362908 A362909 A362910

Keyword

nonn,hard,more

Author

Martin Rubey, May 09 2023

Status

approved