A357895 Number of partitions of the complete graph on n vertices into strokes.

1, 2, 12, 472, 104800

Offset: 1

Author

Yasutoshi Kohmoto and Max Alekseyev, Oct 18 2022

Keywords

• nonn
• more
• walk

Comments

Partition of graph G=(V,E) into strokes is a collection of directed edge-disjoint trails (viewed as sets of directed edges, cf. A357857) in G such that (i) no two trails can be concatenated into a single one; (ii) the corresponding undirected edges form a partition of E.

Crossrefs

Cf. A089243, A131518, A131520, A354228, A131709, A357857.