1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 1 cited
Counting large distances in convex polygons
Filip Morić, David Pritchard
In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one anothe…
math.CO2010
Diameter Bounds for Planar Graphs
Radoslav Fulek, Filip Morić, David Pritchard
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inver…
math.CO2009
On Polygons Excluding Point Sets
Radoslav Fulek, Balázs Keszegh, Filip Morić +1
By a polygonization of a finite point set in the plane we understand a simple polygon having as the set of its vertices. Let and be sets of blue and red points, res…