American Psychological Association 6th edition

HELDEN, G. (2007, January 1). Each maximal planar graph with exactly two separating triangles is Hamiltonian. 155(14). Amsterdam; Lausanne; New York, NY: Elsevier, 2007. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19046564

ISO-690 (author-date, English)

HELDEN, Guido, 2007. Each maximal planar graph with exactly two separating triangles is Hamiltonian. In: [online]. Amsterdam; Lausanne; New York, NY: Elsevier, 2007. 1 January 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19046564

Modern Language Association 9th edition

HELDEN, G. Each maximal planar graph with exactly two separating triangles is Hamiltonian. no. 14, Amsterdam; Lausanne; New York, NY: Elsevier, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19046564.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

HELDEN, G. (2007), “Each maximal planar graph with exactly two separating triangles is Hamiltonian”, in , Vol. 155, Amsterdam; Lausanne; New York, NY: Elsevier, 2007., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19046564.

Warning: These citations may not always be 100% accurate.