Name
Abstract | ||
|---|---|---|
A k-cycle decomposition of a multipartite graph G is said to be gregarious if each k-cycle in the decomposition intersects k distinct partite sets of G. In this paper we prove necessary and sufficient conditions for the existence of such a decomposition in the case where G is the complete equipartite graph, having n parts of size m, and either n equivalent to 0, 1 (mod k), or k is odd and m equivalent to 0 (mod k). As a consequence, we prove necessary and sufficient conditions for decomposing complete equipartite graphs into gregarious cycles of prime length. |
Year | Venue | Keywords |
|---|---|---|
2009 | ELECTRONIC JOURNAL OF COMBINATORICS | systems |
Field | DocType | Volume |
Prime (order theory),Graph,Discrete mathematics,Combinatorics,Multipartite graph,Mathematics | Journal | 16 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 3 |
PageRank | References | Authors |
0.46 | 5 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin R. Smith | 1 | 27 | 5.66 |