Meyniel weakly triangulated graphs — I: Co-perfect orderability Original Research Article

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.