Unified Hanani-Tutte theorem
From MaRDI portal
Publication:2401398
zbMath1369.05045arXiv1612.00688MaRDI QIDQ2401398
Radoslav Fulek, Jan Kynčl, Dömötör Pálvölgyi
Publication date: 8 September 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.00688
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 (5)
On the strong Hanani-Tutte theorem ⋮ Hanani-Tutte for approximating maps of graphs ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Simultaneous Embedding ⋮ Embedding Graphs into Embedded Graphs
Cites Work
- Removing even crossings
- Clustered planarity testing revisited
- On Conway's thrackle conjecture
- Which crossing number is it anyway?
- Bounds for generalized thrackles
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Hanani-Tutte and Related Results
- Toward a theory of crossing numbers
- Adjacent Crossings Do Matter
- Unnamed Item
This page was built for publication: Unified Hanani-Tutte theorem