30 citations · 65 across the 19 of their papers we have counts for
5 papers · 1 filter
Crossing numbers and combinatorial characterization of monotone drawings of
Martin Balko, Radoslav Fulek, Jan Kynčl
In 1958, Hill conjectured that the minimum number of crossings in a drawing of is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…
Extending Partial Representations of Circle Graphs
Steven Chaplick, Radoslav Fulek, Pavel Klavík
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We s…
Estimating the number of disjoint edges in simple topological graphs via cylindrical drawings
Radoslav Fulek
A topological graph drawn on a cylinder whose base is horizontal is \emph{angularly monotone} if every vertical line intersects every edge at most once. Let denote the maxim…
Clustered planarity testing revisited
Radoslav Fulek, Jan Kynčl, Igor Malinović +1
The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every p…
Homometric sets in trees
Radoslav Fulek, Slobodan Mitrović
Let denote a simple graph with the vertex set and the edge set . The profile of a vertex set denotes the multiset of pairwise distances between t…