Strong Hanani-Tutte for the Torus
Discrete Mathematics
2021-04-14 v3 Computational Geometry
Combinatorics
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.
Keywords
Cite
@article{arxiv.2009.01683,
title = {Strong Hanani-Tutte for the Torus},
author = {Radoslav Fulek and Michael J. Pelsmajer and Marcus Schaefer},
journal= {arXiv preprint arXiv:2009.01683},
year = {2021}
}
Comments
minor corrections