{"paper":{"title":"Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Grosse, Gerd Wechsung, Joerg Rothe","submitted_at":"2001-06-19T16:10:55Z","abstract_excerpt":"We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\\phi$ between two isomorphic graphs is as hard as computing $\\phi$ itself. This result optimally improves upon a result of G\\'{a}l et al. We establish a similar, albeit slightly weaker, result about computing complete Hamiltonian cycles of a graph from partial Hamiltonian cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0106041","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}