A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane

@article{Verdire2017ADP,
  title={A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane},
  author={{\'E}ric Colin de Verdi{\`e}re and Vojtech Kaluza and Pavel Pat{\'a}k and Zuzana Pat{\'a}kov{\'a} and M. Tancer},
  journal={ArXiv},
  year={2017},
  volume={abs/1608.07855}
}
  • Éric Colin de Verdière, Vojtech Kaluza, +2 authors M. Tancer
  • Published 2017
  • Computer Science, Mathematics
  • ArXiv
  • We reprove the strong Hanani-Tutte theorem on the projective plane. In contrast to the previous proof by Pelsmajer, Schaefer and Stasi, our method is constructive and does not rely on the characterization of forbidden minors, which gives hope to extend it to other surfaces. Moreover, our approach can be used to provide an efficient algorithm turning a Hanani-Tutte drawing on the projective plane into an embedding. 
    9 Citations
    Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
    • 9
    • PDF
    Metric and analytic methods
    Drawing of graphs and the Hanani – Tutte theorem
    • 2018
    • PDF
    The ℤ2-genus of Kuratowski minors
    • R. Fulek, J. Kyncl
    • Mathematics, Computer Science
    • Symposium on Computational Geometry
    • 2018
    • 4
    • PDF
    Strong Hanani-Tutte for the Torus
    • PDF
    Hanani-Tutte for Radial Planarity
    • 4
    • PDF
    Computational topology of graphs on surfaces
    • 11
    • PDF
    The $\mathbb{Z}_2$-genus of Kuratowski minors
    • PDF

    References

    SHOWING 1-10 OF 45 REFERENCES
    Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
    • M. Schaefer
    • Mathematics, Computer Science
    • Graph Drawing
    • 2012
    • 51
    • PDF
    Strong Hanani--Tutte on the Projective Plane
    • 39
    • PDF
    Block Additivity of Z2-Embeddings
    • 6
    • PDF
    Removing Even Crossings on Surfaces
    • 13
    • PDF
    Clustered Planarity Testing Revisited
    • 22
    • PDF
    Hanani-Tutte and Related Results
    • 36
    • Highly Influential
    • PDF
    A characterization of planar graphs by trémaux orders
    • 41
    A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width
    • 77
    • PDF
    Trémaux trees and planarity
    • 37
    • PDF
    A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
    • B. Mohar
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 1999
    • 167
    • PDF