On the strong Hanani-Tutte theorem (Q2656896): Difference between revisions

A non-separating drawing of a graph is a drawing of the graph that does not contain any separating cycles. A non-separating planar graph is a graph that has a non-separating planar drawing. If every two vertex-disjoint edges in \(D\) cross an even number of times, or if there is a chordless decomposing cycle that decomposes \(D\) into two evenly decomposable drawings, then a drawing \(D\) is evenly decomposable. In this paper, the authors prove that if \(D\) is a non-separating drawing of a graph \(G\) such that any two vertex-disjoint edges in \(D\) cross each other an even number of times, then \(G\) is a non-separating planar graph. Then they use the result to prove a stronger version of the Hanani-Tutte theorem. It is that if \(D\) is an evenly decomposable drawing of a graph \(G\) on the plane, then \(G\) is planar and there is a planar drawing \(D^\prime\) of \(G\) such that any decomposing chordless cycle \(C\) in \(S\) separates vertices \(u\) and \(v\) in \(D^\prime\) if and only if \(C\) separates \(u\) and \(v\) in \(D\).