Abstract
Perfect one-factorization of the complete graph K2n for all n greater and equal to 2 is conjectured. Nevertheless some families of complete graphs were found to have perfect one-factorization. This paper will show some of the perfect one-factorization results in some families of complete graph as well as some result in application. Keywords: complete graph, one-factorization
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.
