30 citations · 65 across the 19 of their papers we have counts for
5 papers · 1 filter
Recognizing Weak Embeddings of Graphs
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding of a graph into a 2-manifold maps…
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
Radoslav Fulek, Jan Kynčl
We find a graph of genus and its drawing on the orientable surface of genus with every pair of independent edges crossing an even number of times. This shows that the stron…
Thrackles: An Improved Upper Bound
Radoslav Fulek, János Pach
A {\em thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle…
Hanani-Tutte for approximating maps of graphs
Radoslav Fulek, Jan Kynčl
We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating…
On the Existence of Ordinary Triangles
Radoslav Fulek, Hossein Nassajian Mojarrad, Márton Naszódi +3
Let be a finite point set in the plane. A \emph{-ordinary triangle} in is a subset of consisting of three non-collinear points such that each of the three lines dete…