Abstract
We establish necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles. © 2001 Academic Press.
Cite
CITATION STYLE
APA
Alspach, B., & Gavlas, H. (2001). Cycle Decompositions of Kn and Kn - I. Journal of Combinatorial Theory. Series B, 81(1), 77–99. https://doi.org/10.1006/jctb.2000.1996
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free