Biedl, Therese, et al. “On the Complexity of Embedding in Graph Products”. Computing in Geometry and Topology, vol. 4, no. 2, May 2025, pp. 5:1-5:18, doi:10.57717/cgt.v4i2.56.