caa a22 4500 475777956 CHVBK 20180406123636.0 cr unu---uuuuu 170329e20000301xx s 000 0 eng 10.1007/s003730050003 doi (NATIONALLICENCE)springer-10.1007/s003730050003 Decompositions of Complete Multipartite Graphs into Cycles of Even Length [Elektronische Daten] [Nicholas J. Cavenagh, Elizabeth J. Billington] 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. Springer-Verlag Tokyo, 2000 Cavenagh Nicholas J. Centre for Combinatorics, Department of Mathematics, The University of Queensland, Brisbane 4072, Australia. e-mail: ejb@maths.uq.edu.au, AU aut Billington Elizabeth J. Centre for Combinatorics, Department of Mathematics, The University of Queensland, Brisbane 4072, Australia. e-mail: ejb@maths.uq.edu.au, AU aut https://doi.org/10.1007/s003730050003 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s003730050003 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Cavenagh Nicholas J. Centre for Combinatorics, Department of Mathematics, The University of Queensland, Brisbane 4072, Australia. e-mail: ejb@maths.uq.edu.au, AU aut NATIONALLICENCE 700 1- Billington Elizabeth J. Centre for Combinatorics, Department of Mathematics, The University of Queensland, Brisbane 4072, Australia. e-mail: ejb@maths.uq.edu.au, AU aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer