We find a graph of genus 5 and its drawing on the orientable surface of genus 4 with every pair of independent edges crossing an even number of times. This shows that the strong Hanani–Tutte theorem cannot be extended to the orientable surface of genus 4. As a base step in the construction we use a counterexample to an extension of the unified Hanani–Tutte theorem on the torus
The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that character...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
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...
In this paper we investigate how certain results related to the Hanani-Tutte theorem can be lifted t...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
A drawing of a graph on a surface is independently even if every pair of independent edges in the dr...
We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte th...
If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even n...
AbstractIn this paper we investigate how certain results related to the Hanani–Tutte theorem can be ...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
We reprove the strong Hanani–Tutte theorem on the projective plane. In contrast to the previous proo...
It is shown that if a graph of n vertices can be drawn on the torus without edge crossings and the m...
The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that character...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
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...
In this paper we investigate how certain results related to the Hanani-Tutte theorem can be lifted t...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
A drawing of a graph on a surface is independently even if every pair of independent edges in the dr...
We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte th...
If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even n...
AbstractIn this paper we investigate how certain results related to the Hanani–Tutte theorem can be ...
A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the dr...
We reprove the strong Hanani–Tutte theorem on the projective plane. In contrast to the previous proo...
It is shown that if a graph of n vertices can be drawn on the torus without edge crossings and the m...
The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that character...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...