Irredundance perfect graph: различия между версиями

Перейти к навигации Перейти к поиску
нет описания правки
Нет описания правки
Нет описания правки
 
Строка 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\'{a}s and Cockayne (1979).
Bollobás and Cockayne (1979).
47

правок

Навигация