Hanani-Tutte for radial planarity. II
From MaRDI portal
Publication:2684882
DOI10.37236/10169OpenAlexW4318313729MaRDI QIDQ2684882
Michael J. Pelsmajer, Radoslav Fulek, Marcus Schaefer
Publication date: 17 February 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/10169
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strip planarity testing for embedded planar graphs
- Removing even crossings
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On approximability by embeddings of cycles in the plane.
- Bounds for generalized thrackles
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Graph Theory
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Hanani-Tutte for Radial Planarity II
- Radial Level Planarity Testing and Embedding in Linear Time
- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
- Towards an implementation of the 3D visibility skeleton
- Solving sparse linear equations over finite fields
- Hierarchies and planarity theory
- Crossing Numbers of Graphs
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Hanani--Tutte and Hierarchical Partial Planarity
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Hanani-Tutte for approximating maps of graphs
- Hanani-Tutte and Related Results
- Toward a theory of crossing numbers
- Hanani-Tutte for Radial Planarity
This page was built for publication: Hanani-Tutte for radial planarity. II