47
правок
Irredundance perfect graph: различия между версиями
Материал из WEGA
нет описания правки
Glk (обсуждение | вклад) Нет описания правки |
ALEXM (обсуждение | вклад) Нет описания правки |
||
| Строка 13: | Строка 13: | ||
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). | |||
