Name
Title | ||
|---|---|---|
Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even |
Abstract | ||
|---|---|---|
In this paper we show that the complete equipartite graph with n parts, each of size 2k, decomposes into cycles of length @l^2 for any even n=4, any integer k=3 and any odd @l such that 3@?@l=3 and n=4 be odd and even integers, respectively. Then there exists a decomposition of the @l-fold complete equipartite graph with n parts, each of size 2k, into cycles of length @l if and only if @l |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2012.02.010 | Discrete Mathematics |
Keywords | Field | DocType |
complete equipartite graph,cycle decomposition,graph decomposition | Integer,Discrete mathematics,Complete graph,Combinatorics,Vertex (geometry),Graph factorization,Cycle decomposition,Multiplicity (mathematics),Regular graph,Windmill graph,Mathematics | Journal |
Volume | Issue | ISSN |
312 | 10 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin R. Smith | 1 | 27 | 5.66 |
| Nicholas J. Cavenagh | 2 | 92 | 20.89 |