The following pages link to Radoslav Fulek (Q419367):
Displaying 50 items.
- Graphs that admit right angle crossing drawings (Q419368) (← links)
- A computational approach to Conway's thrackle conjecture (Q551503) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Linear bound on extremal functions of some forbidden patterns in 0-1 matrices (Q1024495) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- On the existence of ordinary triangles (Q1693316) (← links)
- Thrackles: an improved upper bound (Q1735700) (← links)
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors (Q2167311) (← links)
- Embedding graphs into embedded graphs (Q2205635) (← links)
- Universal point sets for planar three-trees (Q2253908) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4 (Q2300157) (← links)
- Free edge lengths in plane graphs (Q2354683) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- Unified Hanani-Tutte theorem (Q2401398) (← links)
- Homometric sets in trees (Q2509753) (← links)
- On polygons excluding point sets (Q2637725) (← links)
- Hanani-Tutte for radial planarity. II (Q2684882) (← links)
- Bounded Embeddings of Graphs in the Plane (Q2819488) (← links)
- Universal Point Sets for Planar Three-Trees (Q2842172) (← links)
- Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs (Q2849806) (← links)
- Hanani–Tutte, Monotone Drawings, and Level-Planarity (Q2849807) (← links)
- On Disjoint Crossing Families in Geometric Graphs (Q2849808) (← links)
- On disjoint crossing families in geometric graphs (Q2857373) (← links)
- Extending Partial Representations of Circle Graphs (Q2867650) (← links)
- Graphs that admit polyline drawings with few crossing angles (Q2902903) (← links)
- Clustered Planarity Testing Revisited (Q2936950) (← links)
- Towards the Hanani-Tutte Theorem for Clustered Graphs (Q2945188) (← links)
- Vertical Visibility Among Parallel Polygons in Three Dimensions (Q2959771) (← links)
- Hanani-Tutte for Radial Planarity II (Q2961539) (← links)
- Graphs that Admit Right Angle Crossing Drawings (Q3057620) (← links)
- On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles (Q3073653) (← links)
- A Computational Approach to Conway’s Thrackle Conjecture (Q3073675) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- Orthogeodesic Point-Set Embedding of Trees (Q3223943) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- (Q4607898) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- Free Edge Lengths in Plane Graphs (Q4635567) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q4925307) (← links)
- Saturation Problems about Forbidden 0-1 Submatrices (Q4959655) (← links)
- Recognizing Weak Embeddings of Graphs (Q4973046) (← links)
- Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings (Q4979827) (← links)
- Polygons with Prescribed Angles in 2D and 3D (Q5014111) (← links)
- Polygons with Prescribed Angles in 2D and 3D (Q5050003) (← links)
- Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
- (Q5088968) (← links)
- (Q5088969) (← links)
- Hanani-Tutte for approximating maps of graphs (Q5115807) (← links)
