Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability

Abstract We show that P5-free weakly triangulated graphs are perfectly orderable. Our proof is algorithmic, and relies on a notion concerning separating sets, a property of weakly triangulated graphs, and several properties of P5-free weakly triangulated graphs.

[1]  Richard P. Anstee,et al.  Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.

[2]  Chính T. Hoàng,et al.  on the Complexity of Recognizing a Class of Perfectly orderable Graphs , 1996, Discret. Appl. Math..

[3]  Matthias MIDDENDORF,et al.  On the complexity of recognizing perfectly orderable graphs , 1990, Discret. Math..

[4]  Ryan B. Hayward,et al.  Weakly triangulated graphs , 1985, J. Comb. Theory B.

[5]  Chính T. Hoàng,et al.  On brittle graphs , 1988, J. Graph Theory.

[6]  Stephan Olariu,et al.  A charming class of perfectly orderable graphs , 1992, Discret. Math..

[7]  Henry Meyniel,et al.  On the perfect graph conjecture , 1976, Discret. Math..