Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs

The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph G of size m is a, the maximum number of odd cycles in such a cycle decomposition is b and ℓ is an integer such that a≤ℓ≤b where ℓ and m are of the same parity, then there is a cycle decomposition of G with exactly ℓ odd cycles. This conjecture is verified for the line graph of the complete graph. Keywords: Line graph, Eulerian graph, Cycle decomposition

Abstract licence: CC BY-NC-ND

5 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.