✦ LIBER ✦

Packing the Steiner trees of a graph

✍ Scribed by L. Petingi; M. Talafha

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 127 KB
Volume: 54
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20298

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing Steiner Trees: Further Facets

✍ Grötschel, M. (author);Martin, A. (author);Weismantel, R. (author) 📂 Article 📅 1996 🏛 Academic Press 🌐 English ⚖ 382 KB

Packing Steiner Trees: Further Facets

✍ Grötschel, M. (author);Martin, A. (author);Weismantel, R. (author) 📂 Article 📅 1996 🏛 Academic Press 🌐 English ⚖ 382 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__.

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 Three Copies of a Tree into a Co

Packing Three Copies of a Tree into a Complete Graph

✍ Hong Wang; Norbert Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 161 KB

The average Steiner distance of a graph

✍ Dankelmann, Peter; Oellermann, Ortrud R.; Swart, Henda C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB 👁 2 views

The average distance p(G) of a graph G is the average among the distances between all pairs of vertices in G. For n 2 2, the average Steiner n-distance ,4G) of a connected graph G is the average Steiner distance over all sets of n vertices in G. It is shown that for a connected weighted graph G, pu,