A059222
Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.
offset: 1
codomain: ℕ
Declarations
Section titled “Declarations”- A059222computable
Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.