Assertion: graph's edge | /r/HasProperty | equivalent
Facets:
value: to the problem
type: OTHER
Source sentences:
text: For example, since the graph is symmetric , all edges are equivalent.
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.