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

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

Offset: 0

Author

Martin Rubey, May 09 2023

Keywords

• nonn
• hard
• more

Examples

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

Links

• Wikipedia, Treewidth.

Crossrefs

Column k=3 of A263294.

Programs

SageMath

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