Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
- First Online:
- Cite this article as:
- Groß e, A., Rothe, J. & Wechsung, G. Theory Comput. Systems (2002) 35: 81. doi:10.1007/s00224-001-1048-9
- 46 Downloads
We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism φ between two isomorphic graphs is as hard as computing φ itself. This result optimally improves upon a result of Gál, Halevi, Lipton, and Petrank. We establish a similar, albeit slightly weaker, result about computing complete Hamiltonian cycles of a graph from partial Hamiltonian cycles.