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 2019Show all

2 papers · 1 filter

cs.CG2019

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…

math.CO2019

Z_2-genus of graphs and minimum rank of partial symmetric matrices

Radoslav Fulek, Jan Kynčl

The \emph{genus} $g (G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_{g}$ of genus $g$ . A drawing of a graph on a surface is…