7 citations · 13 across the 3 of their papers we have counts for
3 papers
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.CO2010★ 6 cited
Drawing Graphs with Orthogonal Crossings
Radoslav Fulek, Balázs Keszegh, Filip Morić
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertice…
math.CO2010★ 7 cited
Coloring geometric hyper-graph defined by an arrangement of half-planes
Radoslav Fulek
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by hal…