Literaturverzeichnis
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.
R. P. Dilworth, A decomposition theorem for partially ordered sets,Annals of Math.,51 (1950), S. 161–166.
J. Egerváry, Matrixok kombinatorikus tulajdonságairól,Mat. és Fiz. Lapok,38 (1931), S. 16–27.
L. R. Ford, Jr. andD. R. Fulkerson, Maximal flow through a network,Canadian Journal of Math.,8 (1956), S. 399–404.
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), S. 210–218.
D. Gale, A theorem on flows in networks,Pacific Journal of Math.,7 (1957), S. 1073–1082.
T. Gallai, Maximum-Minimum Sätze über Graphen,Acta. Math. Acad. Sci. Hung.,9 (1958), S. 395–434.
A. J. Goldman andA. W. Tucker, Theory of linear programming,Annals of Math. Study,38 (1956), S. 53–97.
A. J. Hoffmann andJ. B. Kruskal, Integral boundary points of convex polyhedra,Annals of Math. Study,38 (1956), S. 223–246.
D. König,Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).
K. Menger,Kurventheorie (Leipzig und Berlin, 1932), S. 221–228.
O. Ore, Studies on directed graphs. I,Annals of Math.,63 (1956), S. 383–406.
A. W. Tucker, Dual systems of homogeneous linear relations,Annals of Math. Study,38 (1956), S. 3–18.
W. T. Tutte, A class of Abelian groups,Canadian Journal of Math.,8 (1956), S. 13–28.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gallai, T. Über reguläre Kettengruppen. Acta Mathematica Academiae Scientiarum Hungaricae 10, 227–240 (1959). https://doi.org/10.1007/BF02063301
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02063301