𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions

✍ Scribed by Reinhard Diestel

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
613 KB
Volume
50
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An O(n2) Divide-and-Conquer Algorithm fo
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
✍ A. Ehrenfeucht; H.N. Gabow; R.M. Mcconnell; S.J. Sullivan πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 526 KB

This paper presents a simple divide-and-conquer algorithm for computing the prime tree decomposition of a two-structure. The algorithm runs in \(O\left(n^{2}\right)\) time, when \(n\) is the number of nodes of the two-structure. A directed or undirected graph is a special case of a two-structure, an

Generation of trees of a graph with the
Generation of trees of a graph with the use of decomposition
✍ Jacek Wojciechowski πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 1015 KB

The method of tree generation of a graph decomposed into any number of parts is described in this paper. The decomposition of a graph is dejined. Theformulafor the generation of trees of a decomposed graph is given in Theorem I. The necessary and suflcient conditions which a graph decomposition must

On the Decomposition of Cayley Color Gra
On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees
✍ J.F. Fink πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 579 KB

We prove that if \(\Delta\) is a minimal generating set for a nontrivial group \(\Gamma\) and \(T\) is an oriented tree having \(|\Delta|\) edges, then the Cayley color graph \(D_{\Delta}(\Gamma)\) can be decomposed into \(|\Gamma|\) edge-disjoint subgraphs, each of which is isomorphic to \(T\); we