Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability

Abstract

We show that Meyniel weakly triangulated graphs are co-perfectly orderable (equivalently , that P 5-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 Meyniel weakly triangulated graphs.

DOI: 10.1016/S0166-218X(96)00008-X

Extracted Key Phrases

Cite this paper

@article{Hayward1997MeynielWT, title={Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability}, author={Ryan B. Hayward}, journal={Discrete Applied Mathematics}, year={1997}, volume={73}, pages={199-210} }