RECOGNIZING CLAW-FREE PERFECT GRAPHS

被引：62

作者：

CHVATAL, V ^{[1
]}

SBIHI, N ^{[1
]}

机构：

[1] CNR,RABAT,MOROCCO

来源：

关键词：

D O I：

10.1016/0095-8956(88)90085-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：154 / 176

页数：23

共 10 条

[1]

Burlet M., 1984, TOPICS PERFECT GRAPH, V88, P225

[2]

Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]

[3] TRANSITIV ORIENTIERBARE GRAPHEN [J].

GALLAI, T .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1967, 18 (1-2) :25-&

[4] ALGORITHMS ON CLIQUE SEPARABLE GRAPHS [J].

GAVRIL, F .

[5]

HARARY F, 1974, REV SOC MAT CHILE, V1, P19

[6] WEAKLY TRIANGULATED GRAPHS [J].

HAYWARD, RB .

[7] STRONG PERFECT-GRAPH CONJECTURE IS TRUE FOR K1,3-FREE GRAPHS [J].

PARTHASARATHY, KR ;

RAVINDRA, G .

[8] DECOMPOSITION OF REGULAR MATROIDS [J].

SEYMOUR, PD .

[9]

WHITESIDES SH, 1984, ANN DISCRETE MATH, V21, P281

[10]

WHITMORE RW, 1981, J MATH BIOL, V12, P31, DOI 10.1007/BF00275201