co.combinatorics - What is simplest polynomial algorithm for PLANARITY?

There are several algorithms that decide in polynomial time whether a graph can be drawn in the plane or not, even many with a linear running time. However, I could not find a very simple algorithm that one could easily and fast explain in class and would show that PLANARITY is in P. Do you know any?If necessary, you can use Kuratowski's or Fary's theorem but no deep stuff, like the graph minor theorem.Also note that I do not care about the running time, I just want something polynomial. Below are the so far 3 best algorithms, showing a simplic...Read more