Menus of kuratowski subgraphs

References

• Johnson , D. 1983 . Crossing number is NP-complete . SIAM J. Disc. Math. , 4 ( 3 ) September : 312 – 316 .
   Web of Science ®Google Scholar
• Hart , Susan O. 1986 . “ Depth-first classification of obstructions to planarity ” . In Doctoral dissertation , San Diego : University of California .
   Google Scholar
• Hopcroft , J. and Tarjan , R. 1974 . Efficient planarity testing . J. Assoc. Comput. Mach. , 21 : 549 – 568 .
   Web of Science ®Google Scholar
• Kuratowski , C. 1930 . Sur le probléme des courbes gauches en topologie . Fundamenta Mathematicae , 15 : 271 – 283 .
   Google Scholar
• Liu , P. C. and Geldmacher , R. C. 1979 . On the deletion of nonplanar edges of a graph . Proc. of the Tenth Southeastern Conference on Combinatorics, Graph Theory, and Computing , 15 : 727 – 738 .
   Google Scholar
• Vo , K.-P. , Dick , W. E. and Williamson , S. G. 1985 . Ranking and unranking planar embeddings . Linear and Multilinear Algebra , 18 : 35 – 65 .
   Google Scholar
• Williamson , S G. 1985 . Combinatorics for Computer Science , Rockville, Maryland : Computer Science Press .
   Google Scholar
• Williamson , S. G. 1980 . Embedding graphs in the plane: algorithmic aspects . Annals of Discrete Math. , 6 : 349 – 384 .
   Google Scholar
• Williamson , S. G. 1984 . Depth-first search and Kuratowski subgraphs . J Assoc Comput Mach. , 31 ( 4 ) : 686 – 693 .
   Google Scholar