413 citations
- Arizona State UniversityUS2 papers
- Georgetown UniversityUS2 papers
- University of California, DavisUS2 papers
- University of MinnesotaUS2 papers
- Aix-Marseille UniversitéFR1 paper
- AlbaNovaSE1 paper
- Albany State UniversityUS1 paper
- Astronomy and SpaceAU1 paper
- Austrian Research Institute for Artificial IntelligenceAT1 paper
- British Columbia Institute of TechnologyCA1 paper
- Brookhaven National LaboratoryUS1 paper
- Çanakkale Onsekiz Mart ÜniversitesiTR1 paper
Showing 2021Show all
3 papers · 1 filter
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★ 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…
cs.GT2021★ 1 cited
An Upper Bound on the State-Space Complexity of Brandubh
Kiernan Compy, Alana Evey, Hunter McCullough +2
Before chess came to Northern Europe there was Tafl, a family of asymmetric strategy board games associated strongly with the Vikings. The purpose of this paper is to study the com…