References
- Bodlaender , H. L. 1993 . On linear time minor tests with Depth-First-Search . Journal of Algorithms , 14 : 1 – 23 .
- Bondy , J. A. and Murthy , V. S. R. 1976 . “ Graph theory with applications ” . American Elsevier publishing co inc .
- Cormen , T.H. , Leiserson , C.E. and Rivest , R. L. 1990 . “ Introduction to Algorithms ” . MIT press .
- Megiddo , N. , Hakimi , S. L. , Garey , M. R. , Johnson , D. S. and Papadimitriou , C. H. 1988 . The complexity of searching a graph . J. Assoc. Comput. Math , 35 : 18 – 44 .
- Knuth , D. 1975 . “ Fundamental Algorithms, 2nd-edition ” . Addison wesley .