Perfect One-Factorization Conjecture

Chriestie Montolalu

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


Full Text:

PDF


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

Refbacks

  • There are currently no refbacks.


Copyright (c)



 Indexed By:

 



 

 


e-ISSN: 2685-1083

p-ISSN: 2302-4224

Creative Commons License


This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.