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
- Austrian Research Institute for Artificial IntelligenceAT1 paper
- British Columbia Institute of TechnologyCA1 paper
- Brookhaven National LaboratoryUS1 paper
- Centre de physique des particules de MarseilleFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Chinese Academy of SciencesCN1 paper
Showing math.COShow all
2 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…