Skip to main content
SpringerLink
Log in

Maximum-Minimum Sätze über Graphen

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literaturverzeichnis

  1. G. B. Dantzig andD. R. Fulkerson, On the max-flow min-cut theorem of networks, Linear Inequalities and Related Systems,Annals of Math. Study,38 (1956), S. 215–221.

    Google Scholar 

  2. R. P. Dilworth, A decomposition theorem for partially ordered sets,Annals of Math.,51 (1950), S. 161–166.

    Google Scholar 

  3. J. Egerváry, Matrixok kombinatorikus tulajdonságairól,Mat. és Fiz. Lapok,38 (1931), S. 16–27.

    Google Scholar 

  4. Ky Fan, On systems of linear inequalities,Annals of Math. Study,38 (1956), S. 99–156.

    Google Scholar 

  5. L. R. Ford, Jr. andD. R. Fulkerson, Maximal flow through a network,Canadian Journal of Math.,8 (1956), S. 399–404.

    Google Scholar 

  6. L. R. Ford, Jr. andD. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem,Canadian Journal of Math.,9 (1957), 210–218.

    Google Scholar 

  7. D. Gale, A theorem on flows in networks,Pacific Journal of Math.,7 (1957), S. 1073–1082.

    Google Scholar 

  8. T. Gallai, Ein neuer Beweis eines Mengerschen Satzes,Journal London Math. Soc.,13 (1938), S. 188–192.

    Google Scholar 

  9. T. Gallai, Gráfokkal kapcsolatos maximum-minimum tételek. I,MTA Mat. és Fiz. Oszt. Közl.,7 (1957), S. 305–338.

    Google Scholar 

  10. T. Gallai, Gráfokkal kapcsolatos maximum-minimum tételek. II,MTA Mat. és Fiz. Oszt. Közl.,8 (1958), S. 1–40.

    Google Scholar 

  11. A. J. Goldman andA. W. Tucker, Theory of linear programming,Annals of Math. Study,38 (1956), S. 53–97.

    Google Scholar 

  12. A. J. Hoffmann andJ. B. Kruskal, Integral boundary points of convex polyhedra,Annals of Math. Study,38 (1956), S. 223–246.

    Google Scholar 

  13. D. König,Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).

  14. K. Menger,Kurventheorie (Leipzig und Berlin, 1932), S. 221–228.

  15. O. Ore, Studies on directed graphs. I,Annals of Math.,63 (1956), S. 383–406.

    Google Scholar 

  16. W. T. Tutte, The I-factors of oriented graphs,Proc. Amer. Math. Soc.,4 (1953), S. 922–931.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Budapest

    T. Gallai

Authors
  1. T. Gallai
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gallai, T. Maximum-Minimum Sätze über Graphen. Acta Mathematica Academiae Scientiarum Hungaricae 9, 395–434 (1958). https://doi.org/10.1007/BF02020271

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02020271

Search

Navigation