Assertion: graph's g | /r/HasProperty | complete graph
Facets:
Source sentences:
text: (G)\leq \Delta (G)} G, unless G is a complete graph or an odd cycle.
text: It is important to note that the above definition breaks down if G is a complete graph, since we cannot then disconnects G by removing vertices.
text: If k = 2 n − 1, then G is the complete graph K 2 n , and hence 1-factorable (see above).