Skip to search formSkip to main contentSkip to account menu

Hanani–Tutte theorem

Known as: Hanani-Tutte theorem 
In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
AlgorithmClustered planarityCrossing number (graph theory)Graph drawing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing
Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MINKNAP): choose… 
2018
2018
Privacy-Preserving Planarity Testing of Distributed Graphs
We study the problem of privacy-preserving planarity testing of distributed graphs. The setting involves several parties that… 
2012
2012
Intersection Patterns of Edges in Topological Graphs
This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle… 
Review
2008
Review
2008
Invited Talks Symmetry , Hadwiger number , pointwise limit of graphs
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map… 
1982
1982
IMPORTANCE OF CALCIUM AND MAGNESIUM IONS FOR POSTEXCITATORY HYPERSENSITIVITY IN THE JUMPING SPIDER (MENEMERUS) EYE
Hypersensitivity of the anterior median eye of the jumping spider Menemerus confusus , following illumination, was unaffected by… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)