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.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2021
- arXiv:
- arXiv:2108.11839
- Bibcode:
- 2021arXiv210811839J
- Keywords:
-
- Mathematics - Combinatorics;
- 05C10 (Primary) 05C15 (Secondary)
- E-Print:
- 8 pages, 4 figures (the reference to MSC 54A40 in the published paper is incorrect