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.

Authors

Ten-Hwang Lai

This author has not been identified. Look up 'Ten-Hwang Lai' in Google

Shu-Shang Wei

This author has not been identified. Look up 'Shu-Shang Wei' in Google