✦ LIBER ✦

Packing trees into complete bipartite graphs

✍ Scribed by Hollingsworth, Susan

Book ID: 118747171
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 350 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On packing trees into complete bipartite

On packing trees into complete bipartite graphs

✍ Raphael Yuster 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 124 KB

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

Packing Three Copies of a Tree into a Complete Bipartite Graph

✍ Hong Wang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 181 KB

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 bipartite graphs

✍ A. Pawel Wojda; Paul Vaderlind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

For two bipartite graphs G = (L, R; E) and G' = (L', R'; E') a bijection f: LwR --\* L'uR' such that f(L) = L' is called hi-placement when f(u)f(v)~E', for every edge uv ~ E (then G and G' are called hi-placeable). We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable.