z-logo
Premium
A complete solution to the existence problem for 1‐rotational k ‐cycle systems of K v
Author(s) -
Wu ShungLiang,
Buratti Marco
Publication year - 2009
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.20217
Subject(s) - mathematics , combinatorics , graph , discrete mathematics
The necessary and sufficient conditions for the existence of a 1‐rotational k ‐cycle system of the complete graph K v are established. The proof provides an algorithm able to determine, directly and explicitly, an odd k ‐cycle system of K v whenever such a system exists. © 2009 Wiley Periodicals,Inc. J Combin Designs 17: 283–293, 2009

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom