A 
-factor of a graph
is a 
-regular subgraph
of order 
.
-factors are a generalization of complete
matchings. A perfect matching is a 1-factor (Skiena
1990, p. 244).
k-Factor
See also
MatchingExplore 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-FactorCite this as:
Weisstein, Eric W. "k-Factor." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/k-Factor.html