Coordinated graph

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

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

Литература

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