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

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Forest-perfect graph''' --- лесо-совершенный граф. The class of '''forest-perfect graphs''' contains all forests and their compliments, all '…»)
 
(нет различий)

Текущая версия от 14:34, 3 мая 2011

Forest-perfect graph --- лесо-совершенный граф.

The class of forest-perfect graphs contains all forests and their compliments, all tree-cographs, and of course all tree-perfect graphs. Another subclass of forest-perfect graphs consists of the [math]\displaystyle{ P_{4} }[/math]-reducible graphs. Forest-perfect graphs are weakly triangulated.