Coordinated graph

Coordinated graph — координатный граф.

A graph $\,G$ is coordinated if the cardinality of a maximum set of cliques of $\,H$ with a common vertex is equal to the cardinality of a minimum partition of the cliques of $\,H$ into clique-independent sets, for every induced subgraph $\,H$ of $\,G$.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.