The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs - TEN-HWANG LAI; SHU-SHANG WEI (Information processing letters, 1993)