The strong perfect graph conjecture of Berge for line graphs of linear 3-colored hypergraphs

被引：0
|
作者：
Babaitsev, AY [1 ]
机构：
[1] Belarusian State Univ, Minsk 220050, BELARUS
来源：
DOKLADY AKADEMII NAUK BELARUSI | 1998年 / 42卷 / 01期
关键词：
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
The well-known Strong Perfect Graph Conjecture of C.Berge states that a graph G is perfect if and only if neither G nor its complement G contain add holes (i. e. induced simple cycles of odd length greater than 3). The Strong Perfect Graph Conjecture is proved for line graphs of linear 3-colored hypergraphs (it means the strong coloring).
引用
收藏
页码：34 / 37
页数：4
相关论文
共 50 条
12345