In 1974 Hopcroft and Tarjan obtained an extremely fast test for this property.
In 1974 Hopcroft and Tarjan obtained an extremely fast test for this property. More recently another test has been developed by Lempel, Even, and Cederbaum. According to that test, if this property exists, then an embedding is obtained. Most famously Kuratowski proved that a graph possesses it if and only if the graph contains no subgraph homoemorphic to either of those two graphs. FTP, a graph possesses what property if it can drawn on a flat surface with no crossed edges?
In 1974 Hopcroft and Tarjan obtained an extremely fast test for this property.
{planarity}