Premium
Cycle systems of the line graph of the complete graph
Author(s) -
Cox B.A.,
Rodger C.A.
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199602)21:2<173::aid-jgt6>3.0.co;2-o
Subject(s) - mathematics , combinatorics , line graph , independent and identically distributed random variables , graph , discrete mathematics , statistics , random variable
For all m (identically equal to) 0 (mod 4), for all n (identically equal to) 0 or 2 (mod m ), and for all n (identically equal to) 1 (mod 2 m ) we find an m ‐cycle decomposition of the line graph of the complete graph K n . In particular, this solves the existence problem when m is a power of two. © 1996 John Wiley & Sons, Inc.