Assertion: graph's g | /r/HasProperty | k-factorable
Facets:
Source sentences:
text: A graph G is said to be k-factorable if it admits a k-factorization.