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

The K-Connectedness of Bipartite Graphs

โœ Scribed by Wright, E. M.

Book ID
120095155
Publisher
Oxford University Press
Year
1982
Tongue
English
Weight
128 KB
Volume
s2-25
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The k-Connectedness of Unlabelled Graphs
The k-Connectedness of Unlabelled Graphs
โœ Walsh, T. R. S.; Wright, E. M. ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 144 KB
K1,k-factorization of bipartite graphs
K1,k-factorization of bipartite graphs
โœ Du Beiliang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› SP Editorial Committee of Applied Mathematics - A ๐ŸŒ English โš– 201 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.