Strong Hanani-Tutte for the Torus

2020/09/01 by Fulek, Radoslav, Pelsmajer, Michael J., Schaefer, Marcus · 1 citation
#Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2009.01683

Abstract

If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.

Cited by

• Generalizations of the Crossing Lemma

Related

• Toward the Hanani-Tutte Theorem for Clustered Graphs
• A Hanani-Tutte Theorem for Cycles
• Toroidal embeddings of cubic projective plane obstructions
• Strong Geometry : Knots
• Connectivity and matching extendability of optimal 1-embedded graphs on the torus