Circular perfect graph

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

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

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

Литература

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