Ten-Hwang Lai Shu-Shang Wei The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs. 21-26 1993 46 Inf. Process. Lett. 1 db/journals/ipl/ipl46.html#LaiW93