We show that the matching book thickness of the Cartesian product of two odd-length cycle-graphs is five, if at least one of the cycles has length 3 or 5.
"On Dispersability of Some Products of Cycles." Missouri J. Math. Sci. 33 (2) 206 - 213, November 2021. https://doi.org/10.35834/2021/3302206