Title of article
Meyniel weakly triangulated graphs — I: Co-perfect orderability Original Research Article
Author/Authors
Ryan B. Hayward، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
12
From page
199
To page
210
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.
Keywords
Perfectly orderable graph , Weakly triangulated graph , Meyniel graph , P5-free graph
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884496
Link To Document