𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of some planar graphs into trees

✍ Scribed by Vojislav Petrović

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
121 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing trees into planar graphs
Packing trees into planar graphs
✍ A. García; C. Hernando; F. Hurtado; M. Noy; J. Tejel 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract In this study, we provide methods for drawing a tree with __n__ vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Grap

Some results on tree decomposition of gr
Some results on tree decomposition of graphs
✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 968 KB

## Abstract We investigate tree decompositions (__T__,(__X__~t~)~tϵV(T)~) whose width is “close to optimal” and such that all the subtrees of __T__ induced by the vertices of the graph are “small.” We prove the existence of such decompositions for various interpretations of “close to optimal” and “

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.

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