✦ LIBER ✦

On the pathwidth of chordal graphs

✍ Scribed by Jens Gusted

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 927 KB
Volume: 45
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90012-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pathwidth of outerplanar graphs

✍ David Coudert; Florian Huc; Jean-Sébastien Sereni 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

## Abstract We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geo

On the chordality of a graph

✍ Terry A. McKee; Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 574 KB

## Abstract The __chordality__ of a graph __G__ = (__V, E__) is defined as the minimum __k__ such that we can write __E__ = __E__~1~ ∩ … ∩ __E__~__k__~ with each (__V, E__~__i__~) a chordal graph. We present several results bounding the value of this generalization of boxicity. Our principal result

On the tree representation of chordal gr

On the tree representation of chordal graphs

✍ Yukio Shibata 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB 👁 1 views

The parallel solution of domination prob

The parallel solution of domination problems on chordal and strongly chordal graphs

✍ Elias Dahlhaus; Peter Damaschke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 975 KB

On the interval number of a chordal grap

On the interval number of a chordal graph

✍ Edward R. Scheinerman 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB 👁 2 views

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum

On self duality of pathwidth in polyhedr

On self duality of pathwidth in polyhedral graph embeddings

✍ Fedor V. Fomin; Dimitrios M. Thilikos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract Let __G__ be a 3‐connected planar graph and __G__^\*^ be its dual. We show that the pathwidth of __G__^\*^ is at most 6 times the pathwidth of __G__. We prove this result by relating the pathwidth of a graph with the cut‐width of its medial graph and we extend it to bounded genus embedd