Table of Contents
International Journal of Combinatorics
Volume 2013 (2013), Article ID 783710, 7 pages
http://dx.doi.org/10.1155/2013/783710
Research Article

Graphs with no Minor Containing a Fixed Edge

Mathematical, Computer, and Information Sciences Division, Office of Naval Research, Arlington, VA 22203, USA

Received 30 November 2012; Accepted 6 February 2013

Academic Editor: Chính T. Hoang

Copyright © 2013 Donald K. Wagner. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. R. Ford and D. R. Fulkerson, “Maximal flow through a network,” Canadian Journal of Mathematics, vol. 8, pp. 399–404, 1956. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. J. B. Orlin, “Max flows in O(nm) time, or better,” Working paper, 2012.
  3. D. K. Wagner, “K3,3 minors and the maximum-flow problem,” Algorithmic Operations Research, vol. 3, no. 1, pp. 30–42, 2008. View at Google Scholar · View at MathSciNet
  4. W. T. Tutte, Graph Theory, Addison-Wesley, Reading, Mass, USA, 1984. View at MathSciNet
  5. K. Wagner, “Über eine Erweiterung eines Satzes von Kuratowski,” Deutsche Mathematik, vol. 2, pp. 280–285, 1937. View at Google Scholar
  6. J. Širáň, “Edges and Kuratowski subgraphs of nonplanar graphs,” Mathematische Nachrichten, vol. 113, pp. 187–190, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  7. F. T. Tseng and K. Truemper, “A decomposition of the matroids with the max-flow min-cut property,” Discrete Applied Mathematics, vol. 15, no. 2-3, pp. 329–364, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. W. T. Tutte, “A theory of 3-connected graphs,” Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen A, vol. 64, pp. 441–455, 1961. View at Google Scholar · View at MathSciNet
  9. R. E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM Journal on Computing, vol. 1, no. 2, pp. 146–160, 1972. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. J. E. Hopcroft and R. E. Tarjan, “Dividing a graph into triconnected components,” SIAM Journal on Computing, vol. 2, pp. 135–158, 1973. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. J. E. Hopcroft and R. E. Tarjan, “Efficient planarity testing,” Journal of the Association for Computing Machinery, vol. 21, pp. 549–568, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. K. Mehlhorn and P. Mutzel, “On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm,” Algorithmica, vol. 16, no. 2, pp. 233–242, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet