z-logo
Premium
Cyclic even cycle systems of the complete graph
Author(s) -
Wu ShungLiang
Publication year - 2012
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20310
Subject(s) - mathematics , combinatorics , graph , integer (computer science) , discrete mathematics , computer science , programming language
In this article, it is proved that for each even integer m ⩾4 and each admissible value n with n >2 m , there exists a cyclic m ‐cycle system of K n , which almost resolves the existence problem for cyclic m ‐cycle systems of K n with m even. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:23–39, 2012

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here