✦ LIBER ✦

On packing trees into complete bipartite graphs

✍ Scribed by Raphael Yuster

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 124 KB
Volume: 163
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00014-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on packing trees into complete bi

A note on packing trees into complete bipartite graphs and on fishburn's conjecture

✍ Y. Caro; Y. Rodity 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 212 KB

In this note we improve significantly the result appeared in [4] by showing that any sequence of trees { T2, 'I;, . , T,} can be packed into the complete bipartite graph K,\_,,n,z (n even) for f = 0.3n. Furthermore we support Fishburn's Conjecture [2] by showing that any sequence {T,, T4,

Packing two bipartite graphs into a comp

Packing two bipartite graphs into a complete bipartite graph

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Packing trees into planar graphs

✍ A. García; C. Hernando; F. Hurtado; M. Noy; J. Tejel 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract In this study, we provide methods for drawing a tree with __n__ vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Grap

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 two forests into a bipartite gra

Packing two forests into a bipartite graph

✍ Wang, Hong 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an ( a , b)-bipartition if G has a bipartition ( X , Y ) such that /XI = a and ( Y / = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit ( a , b)-bipartitions. In this note, w

On the decomposition of kn into complete

On the decomposition of kn into complete bipartite graphs

✍ H. Tverberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__‐2 or fewer complete bipartite graphs.