Determining when a graphic matroid is transversal in linear time

References

• Bondy , J. A. 1972 . Transversal matroids. base-orderable matroids, and graphs . Quart. J. Math. Oxford , 23 ( 2 ) : 81 – 89 .
   Web of Science ®Google Scholar
• Geldmacher , R. C and Liu , P. C. 1980 . An O(max(m,n)) algorithm for finding a subgraph homeomorphic to k4 . Congressus numerantium , 29 ( 2 ) : 597 – 609 .
   Google Scholar
• Hopcroft , J. and Tarjan , R. 1974 . Efficient planarity testing . J. Assoc. Comput. Mach , 23 ( 2 ) : 549 – 568 .
   Web of Science ®Google Scholar
• Vo , K. P. 1983 . Segment graphs, depth-first cycle bases, 3-connectivity and planarity of graphs . Linear and Multilinear Alg. , 13 ( 2 ) : 119 – 141 .
   Google Scholar
• Vo , K. P. 1983 . Finding triconnected components of graphs . Linear and Multilinear Alg. , 13 ( 2 ) : 143 – 165 .
   Google Scholar
• Welsh , D. J. A. 1976 . Matroid Theory , New York, San Francisco , , London : Academic Press .
   Google Scholar
• Williamson , S. G. Combinatorics for Computer Science , Computer Science Press . to be published
   Google Scholar
• Wilson , R. J. 1972 . Introduction to Graph Theory , London : Longman Group Limited .
   Google Scholar