Biedl, Therese, David Eppstein, and Torsten Ueckerdt, trans. 2025. “On the Complexity of Embedding in Graph Products”. Computing in Geometry and Topology 4 (2): 5:1-5. https://doi.org/10.57717/cgt.v4i2.56.