Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete

Michael Krüger, Harald Hempel. Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. In Tetsuo Asano, editor, Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Volume 4288 of Lecture Notes in Computer Science, pages 243-252, Springer, 2006. [doi]

Abstract

Abstract is missing.