@article{Kainen_Joslin_Overbay_2024, title={On Dispersability of Some Circulant Graphs}, volume={28}, url={https://jgaa.info/index.php/jgaa/article/view/2941}, DOI={10.7155/jgaa.v28i1.2941}, abstractNote={<pre>The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. <br>A graph is dispersable if its matching book thickness equals its maximum degree. </pre> <pre>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.</pre>}, number={1}, journal={Journal of Graph Algorithms and Applications}, author={Kainen, Paul C. and Joslin, Samuel and Overbay, Shannon}, year={2024}, month={Jun.}, pages={225–241} }