The Robertson-Seymour theorem is a generalization of another result that tests for this property, which deals with forbidden minors, and a depth-first search for branch points is performed in the Hopcroft-Tarjan algorithm for determining this property.
Schneider's theorem states that this property holds if the dimension of the incidence poset is equal to or less than 3, while Whitney's criterion states that this property holds if the structure in question has a dual. The Robertson-Seymour theorem is a generalization of another result that tests for this property, which deals with forbidden minors, and a depth-first search for branch points is performed in the Hopcroft-Tarjan algorithm for determining this property. Another result states that a structure has this property if and only if it doesn't have K sub 5 or K sub 3,3 as a subgraph; that result is Kuratowski's theorem. FTP, name this property of certain graphs that allows them to be embedded on a two-dimensional surface.
Schneider's theorem states that this property holds if the dimension of the incidence poset is equal to or less than 3, while Whitney's criterion states that this property holds if the structure in question has a dual.
{planar}ity [accept equivalents, like {being planar}]