P-Critical graph

$\,p$-Critical graph — $\,p$-критический граф.

A graph $\,G$ is $\,p$-critical if $\,G$ is not perfect but every proper induced subgraph of $\,G$ is perfect. The celebrated Strong Perfect Graph Conjecture (SPGC) of C. Berge states that $\,p$-critical graphs are only $\,C_{2n+1}$ and $\,C_{2n+1}^{c}$, $\,n \geq 2$.

Литература

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