11 citations · 27 across the 16 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.CO2024
Star arboricity relaxed book thickness of
Paul C. Kainen
A book embedding of the complete graph needs pages and the page-subgraphs can be chosen to be spanning paths (for even) and one spanning star…
math.CO2024
Complexity of graph evolutions
Jeffrey Gao, Paul C. Kainen
A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by…
math.CO2024
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.