APA (7th ed.) Citation

Mohar, B. (1998). Existence of polyhedral embeddings of graphs is NP-complete. Univ. of Ljubljana, Inst. of Mathematics, Physics and Mechanics, Dep. of Mathematics.

Chicago Style (17th ed.) Citation

Mohar, Bojan. Existence of Polyhedral Embeddings of Graphs Is NP-complete. Ljubljana: Univ. of Ljubljana, Inst. of Mathematics, Physics and Mechanics, Dep. of Mathematics, 1998.

MLA (9th ed.) Citation

Mohar, Bojan. Existence of Polyhedral Embeddings of Graphs Is NP-complete. Univ. of Ljubljana, Inst. of Mathematics, Physics and Mechanics, Dep. of Mathematics, 1998.