Просмотр кода страницы Circular perfect graph

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

A [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> is called '''circular perfect''' if <math>\,\omega_{c}(H) = \chi_{c}(H)</math> for each [[induced (with vertices) subgraph|induced subgraph]] <math>\,H</math> of <math>\,G</math>, where <math>\,\omega_{c}</math> is the ''[[circular clique number]]'' and <math>\,\chi_{c}</math> is the ''[[circular chromatic number]]''.

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

==Литература==

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