✦ LIBER ✦

Tree-width, path-width, and cutwidth

✍ Scribed by Ephraim Korach; Nir Solel

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 387 KB
Volume: 43
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90171-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Directed Tree-Width

✍ Thor Johnson; Neil Robertson; P.D. Seymour; Robin Thomas 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 198 KB

We generalize the concept of tree-width to directed graphs and prove that every directed graph with no ``haven'' of large order has small tree-width. Conversely, a digraph with a large haven has large tree-width. We also show that the Hamilton cycle problem and other NP-hard problems can be solved i

Bounded Tree-Width and LOGCFL

✍ E. Wanke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 902 KB

We show that (1) the recognition of tree-width bounded graphs and (2) the decidability of graph properties--which are defined by finite equivalence relations on \(h\)-sourced graphs-on tree-width bounded graphs belong to the complexity class LOGCFL. This is the lowest complexity class known for thes

Tree-width and circumference of graphs

✍ Etienne Birmele 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB

Tree-width, clique-minors, and eigenvalu

Tree-width, clique-minors, and eigenvalues

✍ Yuan Hong 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Let G be a simple graph with n vertices and tw(G) be the tree-width of G. Let (G) be the spectral radius of G and (G) be the smallest eigenvalue of G. The join G∇H of disjoint graphs of G and H is the graph obtained from G + H by joining each vertex of G to each vertex of H . In this paper, several

Surfaces, Tree-Width, Clique-Minors, and

Surfaces, Tree-Width, Clique-Minors, and Partitions

✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 214 KB

In 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph may be partitioned into two subsets, each of which induces an outerplanar graph. Some partial results towards this conjecture are presented. One such result, in which a planar graph may be thus edge partitione

Tree-width and the monadic quantifier hi

Tree-width and the monadic quantifier hierarchy

✍ J.A. Makowsky; J.P. Mariño 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 269 KB

It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is