✦ 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
DOI: 10.1007/bf01125543

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integral packing of trees and branchings

✍ V. A. Trubin 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 278 KB

Packing the Steiner trees of a graph

✍ L. Petingi; M. Talafha 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

Strength and reinforcement of a network

Strength and reinforcement of a network and tree packing

✍ V. A. Trubin 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 895 KB

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

Vertex-Disjoint Packing of Two Steiner T

Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut

✍ Eduardo Uchoa; Marcus Poggi de Aragão 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 301 KB

Packing a tree with a graph of the same

Packing a tree with a graph of the same size

✍ 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__.