Name
Abstract | ||
|---|---|---|
We show that a complete equipartite graph with four partite sets has an edge-disjoint decomposition into cycles of length k if and only if k=3, the partite set size is even, k divides the number of edges in the equipartite graph and the total number of vertices in the graph is at least k. We also show that a complete equipartite graph with four even partite sets has an edge-disjoint decomposition into paths with k edges if and only if k divides the number of edges in the equipartite graph and the total number of vertices in the graph is at least k+1. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.08.009 | Discrete Mathematics |
Keywords | DocType | Volume |
cycle decomposition,path decomposition,complete equipartite graph | Journal | 309 |
Issue | ISSN | Citations |
10 | Discrete Mathematics | 1 |
PageRank | References | Authors |
0.39 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elizabeth J. Billington | 1 | 109 | 27.90 |
| Nicholas J. Cavenagh | 2 | 92 | 20.89 |
| Benjamin R. Smith | 3 | 27 | 5.66 |