Biedl, Therese, David Eppstein, and Torsten Ueckerdt. “On the Complexity of Embedding in Graph Products”. Computing in Geometry and Topology 4, no. 2 (May 21, 2025): 5:1–5:18. Accessed June 5, 2025. https://cgt-journal.org/index.php/cgt/article/view/56.