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 the plane of a non-planar graph contains a pair of independent edges (not both sharing an endpoint) that cross each other an odd number of times. Equivalently, it can be phrased as a planarity criterion: a graph is planar if and only if it has a drawing in which every pair of independent edges crosses evenly (or not at all).
known for
Wikipage redirect
primaryTopic
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 the plane of a non-planar graph contains a pair of independent edges (not both sharing an endpoint) that cross each other an odd number of times. Equivalently, it can be phrased as a planarity criterion: a graph is planar if and only if it has a drawing in which every pair of independent edges crosses evenly (or not at all).
has abstract
In topological graph theory, t ...... rosses evenly (or not at all).
@en
Wikipage page ID
42,787,595
Wikipage revision ID
691,731,192
subject
hypernym
comment
In topological graph theory, t ...... rosses evenly (or not at all).
@en
label
Hanani–Tutte theorem
@en