Assertion: graph's clique | /r/HasProperty | complete subgraph
Facets:
Source sentences:
text: G has a vertex for every clique (complete subgraph) of G; two vertex of κ(G) are linked by an edge if the corresponding cliques differ by one vertex of G .