Assertion: complete graph | /r/HasProperty | special cases of cographs
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.
text: A complete graph (denoted K n {\displaystyle K_{n}} , where n {\displaystyle n} is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum degree, n − 1 {\displaystyle n-1} .