Результаты поиска

'''Berge's conjecture''' — ''[[гипотеза Бержа]].'' In 1960, C.Berge conjectured that a [[graph, undirected graph, nonoriented graph|graph]] is

conjecture''' made by C. Berge states that the only '''minimal imperfect graphs''' are the ...f length at least five and their ''complements''. The chordless odd cycles of length five and their

...perfect graph conjecture|Strong Perfect Graph Conjecture]]'' (SPGC) of C. Berge states that <math>\,p</math>-critical graphs are only <math>\,C_{2n+1}</mat

'''Гипотеза Бержа''' (''[[Conjecture of Berge]]'') — [[Граф]] <math>G</math> является ''совершенн�