BIEDL, Therese; EPPSTEIN, David; UECKERDT, Torsten. On the Complexity of Embedding in Graph Products. Computing in Geometry and Topology, [S. l.], v. 4, n. 2, p. 5:1–5:18, 2025. DOI: 10.57717/cgt.v4i2.56. Disponível em: https://cgt-journal.org/index.php/cgt/article/view/56. Acesso em: 5 jun. 2025.