Terminology for complete k-partite graph where k is not fixed Is there a better term for "complete k-partite graph" in the case where k is not fixed?  If I say "complete k-partite graph", people tend to assume "for some particular k".

In other words, what's a term for any graph for whom each connected component in the complement graph is a clique?

I asked this before, but it was as part of another question, so it was ignored.
I believe the most standard term is complete multipartite graph.