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}
}
L~t G ( V , E) b© an undirected graph ~ t h ver~e~ see V and edge set E. A p~t~ of lcn~h k in G is a sec~uen¢¢ of .k + ~ vor~ico~ (p~, . . . . %, %+ ~) such eha~ (o~, v~+ ~) ¢ E for a~ ~, 1 < ~ < k . ]If in addition v~-v~+~ ~hen the .~~uence is a ~ ea~Hed a cyc~. A H~mi~t~n~n ~ t h of O is a path in ~ ~hat visits every ve~e~ of the ~a~h e ~ l y once. A Sraph is H~m~it~n~n ff it has a H~il~onian p~th. A ~raph is said to be bipa~¢ if its ver~e~ s¢~ c ~ ~e p~r~itioned into ~ o ~ V ~ ~nd ~,'~ such… CONTINUE READING