login
A357895
Number of partitions of the complete graph on n vertices into strokes.
1
1, 2, 12, 472, 104800
OFFSET
1,2
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
KEYWORD
nonn,more,walk
AUTHOR
STATUS
approved