𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Integral packing of trees and branchings

✍ Scribed by V. A. Trubin

Publisher
Springer US
Year
1995
Tongue
English
Weight
278 KB
Volume
31
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two-Trees Optimal T-Join and Integral Pa
Two-Trees Optimal T-Join and Integral Packing of T-Cuts
✍ E. Korach πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 387 KB

Let \(G\) be an undirected graph, \(T\) an even subset of vertices and \(F\) an optimal \(T\)-join, which is a forest of two trees. The main theorem of this paper characterizes the cases, where \((G, T)\) has an optimal packing of \(T\)-cuts which is integral. This theorem unifies and generalizes a

Packing and Decomposition of Graphs with
Packing and Decomposition of Graphs with Trees
✍ Raphael Yuster πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 214 KB

Let H be a tree on h 2 vertices. It is shown that if n is sufficiently large and G=(V, E ) is an n-vertex graph with $(G) wnΓ‚2x , then there are w |E |Γ‚(h&1)x edge-disjoint subgraphs of G which are isomorphic to H. In particular, if h&1 divides |E | then there is an H-decomposition of G. This result

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