Hanani--Tutte and Hierarchical Partial Planarity
DOI10.1137/21M1464749zbMATH Open1504.05200OpenAlexW4309496948MaRDI QIDQ5058130FDOQ5058130
Authors: Marcus Schaefer 
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)
Cites Work
- The graph crossing number and its variants: a survey
- Recognizing string graphs in NP
- Hanani-Tutte for approximating maps of graphs
- The On-Line Encyclopedia of Integer Sequences
- Hierarchical partial planarity
- Simultaneous Graph Embeddings with Fixed Edges
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Decidability of string graphs
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Removing Independently Even Crossings
- Hanani-Tutte, monotone drawings, and level-planarity
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Clustered planarity testing revisited
- Planarity of streamed graphs
- Hanani-Tutte for Radial Planarity II
- 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
- Picking planar edges; or, drawing a graph with a planar subgraph
- Title not available (Why is that?)
- Simultaneous embeddings with few bends and crossings
Cited In (6)
Uses Software
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)
