✦ LIBER ✦

Optimizing weakly triangulated graphs

✍ Scribed by Ryan Hayward; Chính Hoàng; Frédéric Maffray

Publisher: Springer Japan
Year: 1989
Tongue: English
Weight: 733 KB
Volume: 5
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788689

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Ryan Hayward; Chính T. Hoàng; Frédéric Maffray 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 176 KB

Generating weakly triangulated graphs

✍ Hayward, Ryan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 2 views

We show that a graph is weakly triangulated, or weakly chordal, if and only if it can be generated by starting with a graph with no edges, and repeatedly adding an edge, so that the new edge is not the middle edge of any chordless path with four vertices. This is a corollary of results due to Sritha

Algorithms for weakly triangulated graph

Algorithms for weakly triangulated graphs

✍ Jeremy Spinrad; R. Sritharan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 680 KB

Meyniel weakly triangulated graphs — I:

Meyniel weakly triangulated graphs — I: Co-perfect orderability

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

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.

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:

Chromaticity of triangulated graphs

✍ Paul Vaderlind 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

A graph G is called triangulated (or rigid-circuit graph, or chordal graph) if every circuit of G with length greater than 3 has a chord. It can be shown (see, UI, . . . , u,, . Let G = G,.