47
правок
Irredundance perfect graph: различия между версиями
Материал из WEGA
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Irredundance perfect graph''' --- неизбыточно совершенный граф. A graph <math>G</math> is an '''irredundance perfect graph''', if for …») |
ALEXM (обсуждение | вклад) Нет описания правки |
||
| (не показана 1 промежуточная версия 1 участника) | |||
| Строка 8: | Строка 8: | ||
A graph <math>G</math> is '''minimal irredundance imperfect''' if <math>G</math> is not | A graph <math>G</math> is '''minimal irredundance imperfect''' if <math>G</math> is not | ||
irredundance perfect and <math>ir(H) = \gamma(H)</math> for every proper | |||
induced subgraph <math>H</math> of <math>G</math>. | induced subgraph <math>H</math> of <math>G</math>. | ||
The first sufficient condition, for a graph to be irredundance | The first sufficient condition, for a graph to be irredundance | ||
perfect, in terms of a family of forbidden induced subgraphs is due to | perfect, in terms of a family of forbidden induced subgraphs is due to | ||
Bollobás and Cockayne (1979). | |||
