Circular perfect graph

Circular perfect graph — цикловой совершенный граф.

A graph [math]\displaystyle{ \,G }[/math] is called circular perfect if [math]\displaystyle{ \,\omega_{c}(H) = \chi_{c}(H) }[/math] for each induced subgraph [math]\displaystyle{ \,H }[/math] of [math]\displaystyle{ \,G }[/math], where [math]\displaystyle{ \,\omega_{c} }[/math] is the circular clique number and [math]\displaystyle{ \,\chi_{c} }[/math] is the circular chromatic number.

The concept of a circular perfect graph was introduced by Zhu in 2004.

Литература

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