1 citations · 1 across the 1 of their papers we have counts for
8 papers
Strong Hanani-Tutte for the Torus
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
Polygons with Prescribed Angles in 2D and 3D
Alon Efrat, Radoslav Fulek, Stephen Kobourov +1
We consider the construction of a polygon with vertices whose turning angles at the vertices are given by a sequence , , for $i\in\{…
Atomic Embeddability, Clustered Planarity, and Thickenability
Radoslav Fulek, Csaba D. Tóth
We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polyno…
Z_2-genus of graphs and minimum rank of partial symmetric matrices
Radoslav Fulek, Jan Kynčl
The \emph{genus} of a graph is the minimum such that has an embedding on the orientable surface of genus . A drawing of a graph on a surface is…
A Note on a Picture-Hanging Puzzle
Radoslav Fulek, Sergey Avvakumov
In the picture-hanging puzzle we are to hang a picture so that the string loops around nails and the removal of any nail results in a fall of the picture. We show that the leng…
The Crossing Tverberg Theorem
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii +2
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set of at least points in , one can find a partition $X=…