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

P3-Factorization of complete bipartite graphs

โœ Scribed by Kazuhiko Ushio

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
344 KB
Volume
72
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

Balanced bipartite graphs may be complet
Balanced bipartite graphs may be completely star-factored
โœ 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
Pagenumber of complete bipartite graphs
โœ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 929 KB
On K1,k-factorizations of a complete bip
On K1,k-factorizations of a complete bipartite graph
โœ Hong Wang ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 311 KB

We present a necessary condition for a complete bipartite graph K,., to be K,.,-factorizable and a sufficient condition for K,,, to have a K,,,-factorization whenever k is a prime number. These two conditions provide Ushio's necessary and sufficient condition for K,,, to have a K,,,-factorization.

Acyclic orientations of complete biparti
Acyclic orientations of complete bipartite graphs
โœ Douglas B. West ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 216 KB

For a complete bipartite graph, the number of dependent edges in an acyclic orientation can be any integer from n-1 to e, where n and e are the number of vertices and edges in the graph. ## Ke3,words: Bipartite graph; Acyclic orientation Ill combinatorics we often ask whether an integer parameter

Hall parameters of complete and complete
Hall parameters of complete and complete bipartite graphs
โœ M. M. Cropper; A. J. W. Hilton ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 287 KB

## Abstract Given a graph __G__, for each ฯ… โˆˆ__V__(__G__) let __L__(ฯ…) be a list assignment to __G__. The wellโ€known choice number __c__(__G__) is the least integer __j__ such that if |__L__(ฯ…)| โ‰ฅ__j__ for all ฯ… โˆˆ__V__(__G__), then __G__ has a proper vertex colouring ฯ• with ฯ•(ฯ…) โˆˆ __L__ (ฯ…) (โˆ€ฯ… โˆˆ__