On dispersability of some products of cycles

Abstract

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.

8 pages, 4 figures (the reference to MSC 54A40 in the published paper is incorrect; see below)