Hanani--Tutte and Hierarchical Partial Planarity
From MaRDI portal
Publication:5058130
DOI10.1137/21M1464749zbMath1504.05200OpenAlexW4309496948MaRDI QIDQ5058130
Publication date: 2 December 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1464749
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Clustered planarity testing revisited
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Decidability of string graphs
- The graph crossing number and its variants: a survey
- The On-Line Encyclopedia of Integer Sequences
- Planarity of streamed graphs
- Geometry -- intuitive, discrete, and convex. A tribute to László Fejes Tóth
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
- Hanani-Tutte for Radial Planarity II
- Simultaneous Graph Embeddings with Fixed Edges
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Hanani-Tutte for approximating maps of graphs
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Simultaneous Embeddings with Few Bends and Crossings
- Removing Independently Even Crossings
- Hanani-Tutte for Radial Planarity
- Drawing Partially Embedded and Simultaneously Planar Graphs
- Hierarchical partial planarity
- Recognizing string graphs in NP
This page was built for publication: Hanani--Tutte and Hierarchical Partial Planarity