Encyclopedia > 1 > 1-factorable
1-factorable
In graph theory, a 1-factor of a graph is a collection of disjoint edges (a matching). A 1-factorization of a graph G is a collection of 1-factors such that every edge of G is in exactly one of these 1-factors.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)