✦ LIBER ✦

Chromaticity of triangulated graphs

✍ Scribed by Paul Vaderlind

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 159 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120215

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

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

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

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

Spanning triangulations in graphs

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

## Abstract We prove that every graph of sufficiently large order __n__ and minimum degree at least 2__n__/3 contains a triangulation as a spanning subgraph. This is best possible: for all integers __n__, there are graphs of order __n__ and minimum degree ⌈2__n__/3⌉ − 1 without a spanning triangul

Chromatic factorizations of a graph

✍ S. Louis Hakimi; Edward F. Schmeichel 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

Let n, 2 n2 L . . B n, 2 2 be integers. We say that G has an (n,, n2, , . , , n,)-chromatic factorization if G can be edge-factored as G, @ G2 @ + . . @ G, with x ( G , ) = n,, for i = 1,2, . . . , k . The following results are proved : then K,, has an (n,, n2,, . , , n,)-chromatic factorization. W

Path chromatic numbers of graphs

✍ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB