A graph is -factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).
k-Factorable Graph
See also
k-FactorExplore with Wolfram|Alpha
References
Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.Referenced on Wolfram|Alpha
k-Factorable GraphCite this as:
Weisstein, Eric W. "k-Factorable Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/k-FactorableGraph.html