Assertion: graph's edge | /r/HasProperty | set into k matchings
Facets:
Source sentences:
text: An edge coloring with k colors is called a k-edge-coloring and is equivalent to the problem of partitioning the edge set into k matchings.