Name
Abstract | ||
|---|---|---|
. Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph
into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the
cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain “small” decompositions exist, are also
given for arbitrary even cycle lengths. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/s003730050003 | Graphs and Combinatorics |
Keywords | Field | DocType |
mathematics | Discrete mathematics,Topology,Graph,Combinatorics,Multipartite,Multipartite graph,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 1 | 0911-0119 |
Citations | PageRank | References |
19 | 2.76 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas J. Cavenagh | 1 | 92 | 20.89 |
| Elizabeth J. Billington | 2 | 109 | 27.90 |