References

Babar, G.M., M.S.H. Khiyal and A. Saeed, 2006. Finding hamilton circuit in a graph. Proceedings of the 2006 International Conference on Scientific Computing (CSC 2006), June 26-29, 2006, Las Vegas, Nevada, pp: 238-244.

Chalaturnyk, A., 2008. A fast algorithm for finding Hamilton cycles. MSc Thesis, University of Manitoba, Winnipeg, Canada.

Darus, M.M., H. Ibrahim and S. Karim, 2017. Some new theoretical work on half butterfly method for hamiltonian circuit in complete graph. Mat., 33: 113-118.
CrossRef  |  Direct Link  |  

Gopal, A.P., K. Kothapalli, V.C. Venkaiah and C.R. Subramaniam, 2007. Various one-factorizations of complete graphs. Theor. Algorithmic Res., 1: 1-12.
Direct Link  |  

Ibrahim, H., Z. Omar and A.M. Rohni, 2010. New algorithm for listing all permutations. Mod. Appl. Sci., 4: 89-94.
CrossRef  |  Direct Link  |  

Karim, S., H. Ibrahim and H. Sapiri, 2015. A new method for starter sets generation by fixing any element. Proceedings of the 2015 International Conference on Research and Education in Mathematics (ICREM7), August 25-27, 2015, IEEE, Kuala Lumpur, Malaysia, ISBN:978-1-4673-7506-1, pp: 120-123.

Karim, S., H. Ibrahim, Z. Omar and H. Sapiri, 2016. A new starter sets generation method by fixing any element under exchange restriction. Intl. J. appl. Math. Stat., 54: 132-141.
Direct Link  |  

Karim, S., Z. Omar and H. Ibrahim, 2011. Integrated strategy for generating permutation. Intl. J. Contemp. Math. Sci., 6: 1167-1174.
Direct Link  |  

Riaz, K. and M.S.H. Khiyal, 2006. Finding hamiltonian cycle in polynomial time. Inform. Technol. J., 5: 851-859.
CrossRef  |  Direct Link  |  

Simonetto, P., 2011. Visualisation of overlapping sets and clusters with Euler diagrams. Ph.D Thesis, Universite Sciences et Technologies, Bordeaux, France.