2 citations · 2 across the 5 of their papers we have counts for
7 papers · 1 filter
On the maximum diameter of -colorable graphs
Éva Czabarka, Inne Singgih, László A. Székely
Erdős, Pach, Pollack and Tuza [J. Combin. Theory, B 47, (1989), 279-285] conjectured that the diameter of a -free connected graph of order and minimum degree …
An infinite antichain of planar tanglegrams
Éva Czabarka, Stephen J. Smith, László A. Székely
Contrary to the expectation arising from the tanglegram Kuratowski theorem of É. Czabarka, L.A. Székely and S. Wagner [SIAM J. Discrete Math. 31(3): 1732--1750, (2017)], we constru…
Minimum Wiener Index of Triangulations and Quadrangulations
Éva Czabarka, Trevor Olsen, Stephen Smith +1
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations…
Proximity in Triangulations and Quadrangulations
Éva Czabarka, Peter Dankelmann, Trevor Olsen +1
Let be a connected graph. If denotes the arithmetic mean of the distances from to all other vertices of , then the proximity, , of is defined as t…
The Steiner distance problem for large vertex subsets in the hypercube
Éva Czabarka, Josiah Reiswig, László Székely
We find the asymptotic behavior of the Steiner k-diameter of the -cube if is large. Our main contribution is the lower bound, which utilizes the probabilistic method.
Midrange crossing constants for graphs classes
Éva Czabarka, Josiah Reiswig, László Székely +1
For positive integers and , let be the minimum crossing number (the standard planar crossing number) taken over all graphs with vertices and at least edges.…