𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering a graph by complete bipartite graphs

✍ Scribed by P. Erdős; L. Pyber


Book ID
108316064
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
119 KB
Volume
170
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Complete bipartite factorisations by com
✍ N. Martin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 887 KB

We study complete Kp,q-factorisations of Kin, n, Simple necessary conditions are found and we conjecture that these conditions are also sufficient. A general construction is given to find infinite families of factorisations proving the conjecture in many cases. The conjecture is proved for Kl,q-fact

Packing two bipartite graphs into a comp
✍ 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

Antipodal Distance-transitive Covers of
✍ A.A. Ivanov; Robert A. Liebler; Tim Penttila; Cheryl E. Praeger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 480 KB

This paper completes the classification of antipodal distance-transitive covers of the complete bipartite graphs K k , k , where k Ρƒ 3 . For such a cover the antipodal blocks must have size r Ρ€ k . Although the case r Ο­ k has already been considered , we give a unified treatment of r Ρ€ k . We use d

Coverings of complete bipartite graphs a
✍ John Shawe-Taylor πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 648 KB

A construction is given of distance-regular q-fold covering graphs of the complete bipartite graph K qk,,pk, where q is the power of a prime number and k is any positive integer. Relations with associated distance-biregular graphs are also considered, resulting in the construction of a family of dis