In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* and a complete bipartite multigraph λKm,n into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case when the paths in a decomposition need not to have equal lengths.
|Number of pages||8|
|State||Published - 1985|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics