✦ LIBER ✦

Recognizing quasi-triangulated graphs

✍ Scribed by Jeremy P Spinrad

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 206 KB
Volume: 138
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00295-6

No coin nor oath required. For personal study only.

✦ Synopsis

This paper discusses a method for recognizing certain graph classes based on elimination schemes more e ciently. We reduce the time bound for recognizing quasi-triangulated graphs from O(n 3 ) to O(n 2:77 ), and perfect elimination bipartite and cop-win graphs from O(n 3 ) to O(n 3 =log n).

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

Recognizing decomposable graphs

✍ V. Chvátal 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A graph is called decomposable if its vertices can be colored red and blue in such a way that each color appears on at least one vertex but each vertex v has at most one neighbor having a different color from v. We point out a simple and efficient algorithm for recognizing decomposable

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

Algorithms for weakly triangulated graph

Algorithms for weakly triangulated graphs

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