Abstract
A Kotzig factorization of order 2 n + 1 is a Hamilton decomposition together with a near one-factorization of the complete graph of order 2 n + 1 such that each Hamilton circuit contains exactly one edge from each near one-factor. A multiplication construction for Kotzig factorization is given. Since Kotzig factorizations are known to exist for all odd prime orders, they exist for all odd orders.
Sign-in/Register to access full text options 
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.
