𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strength of a graph and packing of trees and branchings

✍ Scribed by V. A. Trubin


Publisher
Springer US
Year
1993
Tongue
English
Weight
525 KB
Volume
29
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Packing the Steiner trees of a graph
✍ L. Petingi; M. Talafha πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 127 KB
Packing and Decomposition of Graphs with
✍ 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 a tree with a graph of the same
✍ P. J. Slater; S. K. Teo; H. P. Yap πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 195 KB

## Abstract We prove that if __T__ is a tree of order __p__ β©Ύ 5 and __G__ is a graph of order __p__ and size __p__ ‐ 1 such that neither __T__ nor __G__ is a star, then __T__ can be embedded in G, the complement of __G__.