As the title says, has anyone found a polynomial time algorithm for checking whether two graphs having a Hamiltonian cycle are isomorphic? Is this problem NP-complete?
Has anyone found polynomial algorithm on Hamiltonian cycle isomorphism?
complexity theory;graph theory;time complexity