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

On the Decomposition of Graphs into Complete Bipartite Graphs

โœ Scribed by Jinquan Dong; Yanpei Liu

Publisher
Springer Japan
Year
2007
Tongue
English
Weight
118 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the decomposition of kn into complete
On the decomposition of kn into complete bipartite graphs
โœ H. Tverberg ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 76 KB ๐Ÿ‘ 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__โ€2 or fewer complete bipartite graphs.

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