Aug 28, 2016 · Moreover, our approach can be used to provide an efficient algorithm turning a Hanani-Tutte drawing on the projective plane into an embedding.

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 ...

In this section, we consider Hanani–Tutte drawings of graphs on the sphere and on the projective plane. We use the standard notation from graph theory. Namely, ...

Oct 1, 2017 · We reprove the strong Hanani-Tutte theorem on the projective plane. In contrast to the previous proof by Pelsmajer, Schaefer and Stasi, our ...

Sep 28, 2024 · Moreover, our approach can be used to provide an efficient algorithm turning a Hanani-Tutte drawing on the projective plane into an embedding.

If a graph can be drawn in the projective plane so that every two nonadjacent edges cross an even number of times, then the graph can be embedded in the ...

Sep 21, 2016 · Definition. Let D be a drawing of a graph G on RP2. We say that an edge e is nontrivial in D if e crosses the crosscap an odd number of ...

A signed graph has a plus or minus sign on each edge. A cycle is balanced or unbalanced depending on whether it contains an even or odd number of negative edges ...

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.

If a graph can be drawn in the projective plane so that every two nonadjacent edges cross an even number of times, then the graph can be embedded in the ...