413 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of MinnesotaUS8 papers
- Indiana University BloomingtonUS5 papers
- Indiana UniversityUS4 papers
- The Ohio State UniversityUS4 papers
- The University of Texas at AustinUS3 papers
- University of Illinois Urbana-ChampaignUS3 papers
- Aix-Marseille UniversitéFR2 papers
- Arizona State UniversityUS2 papers
- Brookhaven National LaboratoryUS2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Columbia UniversityUS2 papers
- Cornell UniversityUS2 papers
4 papers · 1 filter
Characterization of Trees with Maximum Security
Alex S. A. Alochukwu, Audace A. V. Dossou-Olory, Fadekemi J. Osaye +5
The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the s…
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…
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…
A positivity phenomenon in Elser's Gaussian-cluster percolation model
Galen Dorpalen-Barry, Cyrus Hettle, David C. Livingston +4
Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideratio…