Abstract
Let n be an even positive integer and l1, l2,…ls be a sequence of positive integers with a sum equal to 12n(n−1). We prove that Kn, the complete graph of order n, can be decomposed into trails of lengths l1, l2,…,ls if, and only if, s⩾12n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
