✦ LIBER ✦

Plane packings of a tree

✍ Scribed by V.A. Chebakov

Publisher: Elsevier Science
Year: 1972
Weight: 741 KB
Volume: 12
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(72)90042-0

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

Random packing of circles in a plane

✍ D.N. Sutherland 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 430 KB

The random packing of circles in a plane

✍ H.H Kausch; D.G Fesko; N.W Tschoegl 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 769 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 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

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