American Psychological Association 6th edition

MINGJI XIA, PENG ZHANG, & WENBO ZHAO. (2007, January 1). Computational complexity of counting problems on 3-regular planar graphs. 384(1). Amsterdam: Elsevier, 2007. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069685

ISO-690 (author-date, English)

MINGJI XIA, PENG ZHANG and WENBO ZHAO, 2007. Computational complexity of counting problems on 3-regular planar graphs. In: [online]. Amsterdam: Elsevier, 2007. 1 January 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069685

Modern Language Association 9th edition

MINGJI XIA, PENG ZHANG, and WENBO ZHAO. Computational complexity of counting problems on 3-regular planar graphs. no. 1, Amsterdam: Elsevier, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069685.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

MINGJI XIA, PENG ZHANG and WENBO ZHAO. (2007), “Computational complexity of counting problems on 3-regular planar graphs”, in , Vol. 384, Amsterdam: Elsevier, 2007., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069685.

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