✦ LIBER ✦

Packing Three Copies of a Tree into a Complete Bipartite Graph

✍ Scribed by Hong Wang

Publisher: Springer
Year: 2009
Tongue: English
Weight: 181 KB
Volume: 13
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-009-0022-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On packing trees into complete bipartite

On packing trees into complete bipartite graphs

✍ Raphael Yuster 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 124 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 of three copies of a graph

✍ Wang, Hong; Sauer, Norbert 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB 👁 1 views

A graph of order n is said to be 3-placeable if there are three edge-disjoint copies of this graph in K,,. An ( n , n -1)-graph is a graph of order n with n -1 edges. In this paper w e characterize all the (n, n -1)-graphs which contain no cycles of length 3 or 4 and which are 3-placeable.

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

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,