Weak Perfect Graph Conjecture

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

Weak Perfect Graph Conjecture --- слабая гипотеза о совершенных графах.

Weak Perfect Graph Conjecture (or WPGC) is formulated as follows: A graph is perfect if and only if its complement is perfect.

See also

  • Strong Perfect Graph Conjecture.
Источник — http://pco.iis.nsk.su/grapp/index.php?title=Weak_Perfect_Graph_Conjecture&oldid=9479