Assertion: clique's vertex | /r/PartOf | two of the cliques
Facets:
value: exactly
type: DEGREE
Source sentences:
text: A line graph is a graph whose edges can be covered by edge-disjoint cliques in such a way that each vertex belongs to exactly two of the cliques in the cover.
text: It is an example of median graph, and is associated with a median algebra on the cliques of a graph: the median m ( A , B , C ) of three cliques A , B , and C is the clique whose vertices belong to at least two of the cliques A , B , and C .
text: is a graph whose edges can be covered by edge-disjoint cliques in such a way that each vertex belongs to exactly two of the cliques in the cover.
text: It is an example of median graph, and is associated with a median algebra on the cliques of a graph: the median ( , , ) of three cliques , , and is the clique whose vertices belong to at least two of the cliques , , and .