The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs

Ten-Hwang Lai, Shu-Shang Wei. The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs. Inf. Process. Lett., 46(1):21-26, 1993.

Abstract

Abstract is missing.