论文信息 - Two classes of perfect graphs

Two classes of perfect graphs

Abstract We present two classes of perfect graphs. The first class is defined through a construction used by Gallai in his investigation of comparability graphs; the second class contains those Berge graphs defined through a forbidden graph on five vertices.

Liping Sun

[1] Vasek Chvátal,et al. Bull-free Berge graphs are perfect , 1987, Graphs Comb..

[2] T. Gallai. Transitiv orientierbare Graphen , 1967 .

[3] Wen-Lian Hsu,et al. How To Color Claw-Free Perfect Graphs , 1981 .

[4] Alan Tucker. Coloring perfect (K4 - e)-free graphs , 1987, J. Comb. Theory, Ser. B.

[5] K. R. Parthasarathy,et al. The strong perfect-graph conjecture is true for K1, 3-free graphs , 1976, J. Comb. Theory, Ser. B.

[6] Alan Tucker,et al. Critical perfect graphs and perfect 3-chromatic graphs , 1977, J. Comb. Theory, Ser. B.

[7] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[8] Vasek Chvátal,et al. Star-cutsets and perfect graphs , 1985, J. Comb. Theory, Ser. B.

[9] K. R. Parthasarathy,et al. The validity of the strong perfect-graph conjecture for (K4-e)-free graphs , 1979, J. Comb. Theory, Ser. B.

[10] Stephan Olariu,et al. Paw-Fee Graphs , 1988, Inf. Process. Lett..

[11] Wen-Lian Hsu,et al. The Perfect Graph Conjecture on Special Graphs — A Survey , 1984 .

[12] Henry Meyniel,et al. A New Property of Critical Imperfect Graphs and some Consequences , 1987, Eur. J. Comb..

[13] Leslie E. Trotter,et al. Graphical properties related to minimal imperfection , 1979, Discret. Math..