Assertion: graph's g | /r/HasProperty | constructed
Facets:
value: by removing a perfect matching
type: MANNER
Source sentences:
text: G can be constructed as follows.
text: If k = 2 n − 2, then G can be constructed by removing a perfect matching from K 2 n .