Assertion: connected graph | /r/HasProperty | 2k-regular
Facets:
Source sentences:
text: If a connected graph is 2k-regular and has an even number of edges it may also be k-factored, by choosing each of the two factors to be an alternating subset of the edges of an Euler tour.