✦ LIBER ✦

Meyniel weakly triangulated graphs — I: Co-perfect orderability

✍ Scribed by Ryan B. Hayward

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 872 KB
Volume: 73
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00008-x

No coin nor oath required. For personal study only.

✦ Synopsis

We show that Ps-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 Ps-free weakly triangulated graphs.

📜 SIMILAR VOLUMES

Meyniel weakly triangulated graphs II: A

Meyniel weakly triangulated graphs II: A theorem of Dirac

✍ Ryan B. Hayward 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 477 KB

WC gcneralizc a theorem due to Dirac and show that every Mcyniel weakly triangulated graph has some vertex which is not the middle vertex of any P;. Our main tool is a separating set notion known as a handle. 01997 Elsevicr Science B.V. k'c,~~ortl.s: