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

@article{Lai1993TheEH,
title={The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs},
author={Ten-Hwang Lai and Shu-Shang Wei},
journal={Inf. Process. Lett.},
year={1993},
volume={46},
pages={21-26}
}