In this paper we investigate how certain results related to the Hanani-Tutte theorem can be lifted to orientable surfaces of higher genus. We give a new simple, geometric proof that the weak Hanani-Tutte theorem is true for higher-genus surfaces. We extend the proof to prove that bipartite generalized thrackles in a surface S can be embedded in S. We also show that a result of Pach and Tóth that allows the redrawing of a graph removing intersections on even edges remains true on highergenus surfaces. As a consequence, we can conclude that crS(G), the crossing number of the graph G on surface S, is bounded by 2 ocrS(G) 2, where ocr(G)S is the odd crossing number of G on surface S. Finally, we begin an investigation of optimal crossing config...
If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even n...
A drawing of a graph on a surface is independently even if every pair of independent edges in the dr...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...
AbstractIn this paper we investigate how certain results related to the Hanani–Tutte theorem can be ...
We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of i...
We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of i...
If a graph can be drawn on the torus so that every two independent edges cross an even number of tim...
A thrackle on a surface X is a graph of size e and order n drawn on X such that every two distinct e...
Let ck = crk (G) denote the minimum number of edge crossings when a graph G is drawn on an orientabl...
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an eve...
An edge in a drawing of a graph is called $\textit{even}$ if it intersects every other edge of the g...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
We consider relations between the size, treewidth, and local crossing number (maximum crossings per ...
AbstractAn edge in a drawing of a graph is called even if it intersects every other edge of the grap...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even n...
A drawing of a graph on a surface is independently even if every pair of independent edges in the dr...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...
AbstractIn this paper we investigate how certain results related to the Hanani–Tutte theorem can be ...
We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of i...
We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of i...
If a graph can be drawn on the torus so that every two independent edges cross an even number of tim...
A thrackle on a surface X is a graph of size e and order n drawn on X such that every two distinct e...
Let ck = crk (G) denote the minimum number of edge crossings when a graph G is drawn on an orientabl...
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an eve...
An edge in a drawing of a graph is called $\textit{even}$ if it intersects every other edge of the g...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
We consider relations between the size, treewidth, and local crossing number (maximum crossings per ...
AbstractAn edge in a drawing of a graph is called even if it intersects every other edge of the grap...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even n...
A drawing of a graph on a surface is independently even if every pair of independent edges in the dr...
AbstractThe nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in ...