Hanani--Tutte and Hierarchical Partial Planarity
From MaRDI portal
Publication:5058130
Cites work
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Clustered planarity testing revisited
- Decidability of string graphs
- Drawing partially embedded and simultaneously planar graphs
- Geometry -- intuitive, discrete, and convex. A tribute to László Fejes Tóth
- Hanani-Tutte for Radial Planarity
- Hanani-Tutte for Radial Planarity II
- Hanani-Tutte for approximating maps of graphs
- Hanani-Tutte, monotone drawings, and level-planarity
- Picking planar edges; or, drawing a graph with a planar subgraph
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Recognizing string graphs in NP
- Removing Independently Even Crossings
- Simultaneous Graph Embeddings with Fixed Edges
- Simultaneous embeddings with few bends and crossings
- String graphs requiring exponential representations
- String graphs. II: Recognizing string graphs is NP-hard
- Synchronized planarity with applications to constrained planarity problems
- The On-Line Encyclopedia of Integer Sequences
- The graph crossing number and its variants: a survey
- Toward a theory of planarity: Hanani-Tutte and planarity variants
Cited in
(6)
This page was built for publication: Hanani--Tutte and Hierarchical Partial Planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058130)