11 citations · 16 across the 2 of their papers we have counts for
3 papers
math.CO2021★ 11 cited
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…
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.
math.CO2021★ 5 cited
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…