Assertion: k partite graph | /r/HasProperty | recognized in polynomial time
Facets:
Source sentences:
text: Complete k-partite graphs, complete multipartite graphs, and their complement graphs, the cluster graphs, are special cases of cographs, and can be recognized in polynomial time even when the partition is not supplied as part of the input.