1. MSOL restricted contractibility to planar graphs;Abello,2012
2. Efficient planarity testing;Hopcroft;J. ACM,1974
3. Crossing number is NP-complete;Garey;SIAM J. Algebr. Discrete Methods,1983
4. Obtaining a planar graph by vertex deletion;Marx,2007
5. Computing crossing number in linear time;Kawarabayashi,2007