Hanani-Tutte and Monotone Drawings
From MaRDI portal
Publication:3104784
DOI10.1007/978-3-642-25870-1_26zbMath1341.05174OpenAlexW1517436122MaRDI QIDQ3104784
Radoslav Fulek, Marcus Schaefer, Michael J. Pelsmajer, Daniel Štefanković
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_26
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Unnamed Item ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
Cites Work
- Removing even crossings
- A note on the parity of the number of crossings of a graph
- Which crossing number is it anyway?
- Towards area requirements for drawing hierarchically planar graphs
- Monotone crossing number
- Bounds for generalized thrackles
- Odd crossing number and crossing number are not the same
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- On the Characterization of Level Planar Trees by Minimal Patterns
- Towards an implementation of the 3D visibility skeleton
- Hierarchies and planarity theory
- Bounds for rectilinear crossing numbers
- Hanani-Tutte and Related Results
- Removing Independently Even Crossings
- Toward a theory of crossing numbers
This page was built for publication: Hanani-Tutte and Monotone Drawings
