R. Fulek

activity

20092020

most citedCrossing numbers and combinatorial characterization of monotone drawings of

K_{n}

30 citations · 65 across the 19 of their papers we have counts for

collaborators

Showing 2016Show all

5 papers · 1 filter

math.CO2016

Unified Hanani-Tutte theorem

Radoslav Fulek, Jan Kynčl, Dömötör Pálvölgyi

We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph $G$ has a drawing $D$ in the plane where every pair of indepen…

cs.CG2016

Bounded embeddings of graphs in the plane

Radoslav Fulek

A drawing in the plane ( $R^{2}$ ) of a graph $G = (V, E)$ equipped with a function $γ : V \to N$ is \emph{ $x$ -bounded} if (i) $x (u) < x (v)$ whenever $γ (u) < γ (v)$ a…

cs.CG2016

Hanani-Tutte for Radial Planarity II

Radoslav Fulek, Michael Pelsmajer, Marcus Schaefer

A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_{1}, \dots, C_{k}$ with common center $c$ , and edges are drawn radially: every edge inter…

cs.CG2016

Embedding graphs into embedded graphs

Radoslav Fulek

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that t…

cs.CG2016

C-planarity of Embedded Cyclic c-Graphs

Radoslav Fulek

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler gra…