On dispersability of some circulant graphs
arXiv:2109.10163
Abstract
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 equals its maximum degree. Minimum page matching book embeddings are given for bipartite and for most non-bipartite circulants contained in the (Harary) cube of a cycle and for various higher-powers.
20 pages, 14 figures, accepted for publication in the Journal of Graph Algorithms and Applications