Perfect One-Factorization Conjecture
DOI:
https://doi.org/10.35799/dc.4.1.2015.8340Abstract
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
Downloads
How to Cite
Montolalu, C. (2015). Perfect One-Factorization Conjecture. d\’Cartesian: Jurnal Matematika Dan Aplikasi, 4(1), 114–121. https://doi.org/10.35799/dc.4.1.2015.8340
Issue
Section
Articles