11 citations · 16 across the 5 of their papers we have counts for
6 papers · 1 filter
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.
Graph embeddings with no Hamiltonian extensions
Paul C. Kainen, Shannon Overbay
We show that extending an embedding of a graph in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of…
Book embeddings of graphs and a theorem of Whitney
Paul C. Kainen, Shannon Overbay
It is shown that the number of pages required for a book embedding of a graph is the maximum of the numbers needed for any of the maximal nonseparable subgraphs and that a plane gr…
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…
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.
Cubic planar bipartite graphs are dispersable
Paul C. Kainen, Shannon Overbay
A graph is called dispersable if it has a book embedding in which each page has maximum degree 1 and the number of pages is the maximum degree. Bernhart and Kainen conjectured ever…