Citazione Stile APA (7a Edizione)

Loth, J. C., Halasz, K., Masařík, T., Mohar, B., & Šámal, R. (2022). Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic.

Citazione stile Chigago Style (17a edizione)

Loth, Jesse Campion, Kevin Halasz, Tomáš Masařík, Bojan Mohar, e Robert Šámal. Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs Is Logarithmic. 2022.

Citatione MLA (9a ed.)

Loth, Jesse Campion, et al. Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs Is Logarithmic. 2022.