17 citations · 85 across the 28 of their papers we have counts for
19 papers · 1 filter
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, Vít Jelínek +3
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not t…
Erdős--Szekeres-type problems in the real projective plane
Martin Balko, Manfred Scheucher, Pavel Valtr
We consider point sets in the real projective plane and explore variants of classical extremal problems about planar point sets in this setting, with a main focus o…
Tight bounds on the expected number of holes in random point sets
Martin Balko, Manfred Scheucher, Pavel Valtr
For integers and , a -hole in a set of points in general position in is a -tuple of points from in convex position such that the…
On the Connectivity and the Diameter of Betweenness-Uniform Graphs
David Hartman, Aneta Pokorná, Pavel Valtr
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have…
Linear Layouts of Complete Graphs
Stefan Felsner, Laura Merker, Torsten Ueckerdt +1
A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an ABAB-pattern (ABBA-patte…
Holes and islands in random point sets
Martin Balko, Manfred Scheucher, Pavel Valtr
For , let be a set of points in in general position. A set of points from is a -island in if the convex hull $\mathrm{conv}(I)…