Akiyama, Takanori; Nishizeki, Takao; Saito, Nobuji NP-completeness of the Hamiltonian cycle problem for bipartite
graphs.J. Inform. Process. 3 (1980/81), no. 2, 73–76.
Links to the journal or article are not yet available
For users without a
, Relay Station allows linking from MR numbers in online mathematical literature
directly to electronic journals and original articles.
Subscribers receive the added value of full MathSciNet reviews.