[1]
“Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths”, GJCST, vol. 12, no. C14, pp. 11–17, Mar. 2012, Accessed: Jun. 05, 2026. [Online]. Available: https://computerresearch.org/index.php/computer/article/view/100545