Perfect One-Factorization Conjecture

Authors

  • Chriestie Montolalu

DOI:

https://doi.org/10.35799/dc.4.1.2015.8340

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

Author Biography

Chriestie Montolalu

Program Studi Matematika, FMIPA, Univeritas Sam Ratulangi Manado

Downloads

How to Cite

Montolalu, C. (2015). Perfect One-Factorization Conjecture. d’Cartesian, 4(1), 114–121. https://doi.org/10.35799/dc.4.1.2015.8340

Issue

Vol. 4 No. 1 (2015): Maret 2015

Section

Articles

License

Hak cipta

Most read articles by the same author(s)