DeepAI
Log In Sign Up

Strong Hanani-Tutte for the Torus

09/01/2020
by   Radoslav Fulek, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/20/2022

A tight bound for the number of edges of matchstick graphs

A matchstick graph is a plane graph with edges drawn as unit-distance li...
07/24/2020

Improving the dilation of a metric graph by adding edges

Most of the literature on spanners focuses on building the graph from sc...
09/14/2017

Embedded-Graph Theory

In this paper, we propose a new type of graph, denoted as "embedded-grap...
08/30/2018

The number of crossings in multigraphs with no empty lens

Let G be a multigraph with n vertices and e>4n edges, drawn in the plane...
08/25/2020

On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

A star-simple drawing of a graph is a drawing in which adjacent edges do...
09/01/2017

Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4

We find a graph of genus 5 and its drawing on the orientable surface of ...
08/24/2020

Odd wheels are not odd-distance graphs

An odd wheel graph is a graph formed by connecting a new vertex to all v...