American Psychological Association 6th edition

TEN-HWANG LAI, & SHU-SHANG WEI. (1993). The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs. Information Processing Letters, 46(1), 21-26.

ISO-690 (author-date, English)

TEN-HWANG LAI und SHU-SHANG WEI, 1993. The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs. Information processing letters. 1 Januar 1993. Vol. 46, no. 1, p. 21-26.

Modern Language Association 9th edition

TEN-HWANG LAI, und SHU-SHANG WEI. „The Edge Hamiltonian Path Problem Is NP-Complete for Bipartite Graphs“. Information Processing Letters, Bd. 46, Nr. 1, Januar 1993, S. 21-26.

Mohr Siebeck - Recht (Deutsch - Österreich)

TEN-HWANG LAI/SHU-SHANG WEI: The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs, Information processing letters 1993, 21-26.

Emerald - Harvard

TEN-HWANG LAI und SHU-SHANG WEI. (1993), „The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs“, Information Processing Letters, Vol. 46 No. 1, S. 21-26.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.