๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Ck-factorization of complete bipartite graphs

โœ Scribed by Hikoe Enomoto; Takashi Miyamoto; Kazuhiko Ushio


Publisher
Springer Japan
Year
1988
Tongue
English
Weight
141 KB
Volume
4
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


P3-Factorization of complete bipartite g
โœ Kazuhiko Ushio ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

P,-factorization of K,,,, is (i) m + n -0 (mod 3), (ii) m < 2n, (iii) n s 2m and (iv) 3mn/2(m + n) is an integer.

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

Balanced bipartite graphs may be complet
โœ Nigel Martin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 137 KB ๐Ÿ‘ 1 views

We conclude the study of complete K1,q-factorizations of complete bipartite graphs of the form Kn,n and show that, so long as the obvious Basic Arithmetic Conditions are satisfied, such complete factorizations must exist.

Pagenumber of complete bipartite graphs
โœ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 929 KB