✦ LIBER ✦

Optimal tree packing

✍ Scribed by A. V. Anisimov

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 286 KB
Volume: 12
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal B-tree packing

✍ Timothy M Klein; Kenneth J Parzygnat; Alan L Tharp 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Construction of a minimal tree packing i

Construction of a minimal tree packing in optimal memory allocation

✍ N. M. Khaikin; E. I. Zak 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 618 KB

Optimal rectangle packing

✍ Richard E. Korf; Michael D. Moffitt; Martha E. Pollack 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 648 KB

Packing three trees

✍ Mariusz Woźniak 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We present some results concerning edge-disjoint placement of two or three copies of a tree, as well as a theorem about the packing of three trees into the complete graph K,. ## 1. Terminology We shall use standard graph theory notation. A finite, undirected graph G consists of a vertex set V(G) a

Packing in trees

✍ Michael A. Henning 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Let G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of all vertices adjacent with v in G, while the closed neighbourhood of v is N(v) U {v}. A packing of a graph G is a set of vertices whose closed neighbourhoods are pairwise disjoint. Equivalently, a packing of

On the tree packing problem

✍ Shigeru Masuyama 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 338 KB