✦ LIBER ✦

Packing Three Copies of a Tree into a Complete Graph

✍ Scribed by Hong Wang; Norbert Sauer

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 161 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 copies of a sparse graph int

Packing two copies of a sparse graph into a graph with restrained maximum degree

✍ Hong Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract We show that if a tree __T__ is not a star, then there is an embedding σ of __T__ in the complement of __T__ such that the maximum degree of __T__∪σ(__T__) is at most Δ(__T__)+2. We also show that if __G__ is a graph of order __n__ with __n__−1 edges, then with several exceptions, there

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

A covering construction for packing disj

A covering construction for packing disjoint copies of the Hoffman-Singleton graph into K50

✍ Jana Ŝiagiová; Mariusz Meszka 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into __K__~50~. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience (www.interscience

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 the Steiner trees of a graph

✍ L. Petingi; M. Talafha 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB