✦ LIBER ✦

Triangulated graphs and the elimination process

✍ Scribed by Donald J Rose

Publisher: Elsevier Science
Year: 1970
Tongue: English
Weight: 653 KB
Volume: 32
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90282-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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,.

Parallel computation of perfect eliminat

Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs

✍ S.D. Nikolopoulos; S.D. Danielopoulos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 722 KB

Wing-triangulated graphs are perfect

✍ Hougardy, Stefan; Le, Van Bang; Wagler, Annegret 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

The wing-graph W (G) of a graph G has all edges of G as its vertices; two edges of G are adjacent in W (G) if they are the nonincident edges (called wings) of an induced path on four vertices in G. Hoàng conjectured that if W (G) has no induced cycle of odd length at least five, then G is perfect. A

More characterizations of triangulated g

More characterizations of triangulated graphs

✍ Claude Benzaken; Yves Crama; Pierre Duchet; Peter L. Hammer; Frédéric Maffray 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

## Abstract New characterizations of triangulated and cotriangulated graphs are presented. Cotriangulated graphs form a natural subclass of the class of strongly perfect graphs, and they are also characterized in terms of the shellability of some associated collection of sets. Finally, the notion o

A relationship between triangulated grap

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs

✍ Dale J. Skrien 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in