TOPICS
Search

k-Factor


A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).


See also

Matching

Explore 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-Factor

Cite this as:

Weisstein, Eric W. "k-Factor." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/k-Factor.html

Subject classifications