3 papers
math.CO2024
All bipartite circulants are dispersable
Shannon Overbay, Samuel Joslin, Paul C. Kainen
We show that a cyclic vertex order due to Yu, Shao and Li gives a dispersable book embedding for any bipartite circulant.
math.CO2021
On dispersability of some circulant graphs
Paul C. Kainen, Samuel S. Joslin, Shannon Overbay
The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. A graph is dispersable if its matching book thickness equ…
math.CO2021
On dispersability of some products of cycles
Samuel S. Joslin, Paul C. Kainen, Shannon Overbay
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.