## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in oneβtoβone correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com
Balanced star decompositions of regular multigraphs and -fold complete bipartite graphs
β Scribed by Hung-Chih Lee; Chiang Lin
- Book ID
- 108113551
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 203 KB
- Volume
- 301
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract For __k__β=β1 and __k__β=β2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edgeβdisjoint __k__βregular subgraphs of specified orders __m__~1~,__m__~2~,β¦ ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge
Graham and Pollak 121 proved that n -1 is the minimum number of edge-disjoint complete bipartite subgraphs into which the edges of K,, decompose. Tverberg 161, using a linear algebraic technique, was the first to give a simple proof of this result. We apply Tverberg's technique to obtain results for
If rjn Γ 1 and rn is even, then K n can be expressed as the union of t nΓ1 r edgedisjoint isomorphic r-regular r-connected factors.