๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Tree-decompositions of graphs (I)

โœ Scribed by Minyong Shi

Publisher
Springer
Year
1997
Tongue
English
Weight
347 KB
Volume
42
Category
Article
ISSN
1001-6538

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tree-decompositions, tree-representabili
Tree-decompositions, tree-representability and chordal graphs
โœ Reinhard Diestel ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 427 KB

The following assertions are shown to be equivalent, for any countable graph G: (1) G can be represented as the intersection graph of a family of subtrees of a tree; (2) G admits a tree-decomposition (Robertson/Seymour) into primes; (3) G is chordal, and G admits a simpkial tree-decomposition (Halin

On resolvable tree-decompositions of com
On resolvable tree-decompositions of complete graphs
โœ Zbigniew Lonc ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 355 KB ๐Ÿ‘ 1 views

A partition of the edge set of a graph H into subsets inducing graphs H,, . . . , H, isomorphic to a graph G is said to be a G-decomposition of H. A G-decomposition of H is resolvable if the set {H,, . . . , H,} can be partitioned into subsets, called resolution classes, such that each vertex of H

Tree decompositions for a class of graph
Tree decompositions for a class of graphs
โœ Minyong Shi; Yanjun Li; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

For a graph G, if E(G) can be partitioned into several pairwise disjoint sets as {EI,& . . . , El} such that for any i with 1 *3. We prove that (i) for any %-graph of order n 23, it has both a {n,n -2}tree-decomposition and a {n -1,n -1}-tree-decomposition, and moreover, these two kinds of tree-deco

Tree decomposition of graphs
Tree decomposition of graphs
โœ Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 207 KB ๐Ÿ‘ 1 views

with โฆ G G V r2 q 10 h V log V , and h y 1 divides E , then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices.