12 citations · 49 across the 21 of their papers we have counts for
25 papers · 1 filter
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square
Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy +5
Let be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of with a straight line segment. Color these edges red if the…
Universal rooted phylogenetic tree shapes and universal tanglegrams
Ann Clifton, Eva Czabarka, Kevin Liu +4
We provide an lower bound and an upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted b…
Some remarks on the midrange crossing constant
É. Czabarka, I. Singgih, L. A. Székely +1
We verify an upper bound of Pach and Tóth [Combinatorica 17(1997), 427-439, Discrete and Computational Geometry 36(2006), 527-552] on the midrange crossing constant. Details of the…
Wiener Index and Remoteness in Triangulations and Quadrangulations
Éva Czabarka, Peter Dankelmann, Trevor Olsen +1
Let be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the ma…
A Size Condition for Diameter Two Orientable Graphs
Garner Cochran, Éva Czabarka, Peter Dankelmann +1
It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for every simple graph of order and size at least has an orientation…
Using Block Designs in Crossing Number Bounds
John Asplund, Eva Czabarka, Gregory Clark +6
The crossing number ${\mbox {cr}}(G)$ of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing…