All bipartite circulants are dispersable
Shannon Overbay, Samuel Joslin, Paul C. Kainen
TL;DR
This paper proves that all bipartite circulant graphs can be embedded into a dispersable book structure using a cyclic vertex order, extending understanding of graph embeddings.
Contribution
It introduces a cyclic vertex order approach that guarantees dispersable book embeddings for all bipartite circulant graphs.
Findings
All bipartite circulants are dispersable.
A cyclic vertex order yields dispersable embeddings.
The method applies universally to bipartite circulants.
Abstract
We show that a cyclic vertex order due to Yu, Shao and Li gives a dispersable book embedding for any bipartite circulant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography