On dispersability of some products of cycles
Combinatorics
2021-08-27 v1
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.
Cite
@article{arxiv.2108.11839,
title = {On dispersability of some products of cycles},
author = {Samuel S. Joslin and Paul C. Kainen and Shannon Overbay},
journal= {arXiv preprint arXiv:2108.11839},
year = {2021}
}
Comments
8 pages, 4 figures (the reference to MSC 54A40 in the published paper is incorrect; see below)