On dispersability of some products of cycles

TL;DR

This paper investigates the matching book thickness of Cartesian products of odd cycles, establishing that it is five under specific conditions related to the cycle lengths.

Contribution

It provides new results on the matching book thickness for Cartesian products of odd cycles, particularly when one cycle has length 3 or 5.

Findings

Matching book thickness is five when at least one cycle length is 3 or 5.

The result applies to Cartesian products of two odd cycles.

The study advances understanding of graph embedding properties.

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.