Maximum-Minimum Sätze über Graphen-Reference-Cited by-同舟云学术

Maximum-Minimum Sätze über Graphen

Published:1958-09 Issue:3-4 Volume:9 Page:395-434
ISSN:0001-5954
Container-title:Acta Mathematica Academiae Scientiarum Hungaricae
language:de
Short-container-title:Acta Mathematica Academiae Scientiarum Hungaricae

Author:

Gallai T.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF02020271.pdf

Reference16 articles.

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.

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

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

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

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

Cited by 60 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A network flow approach to a common generalization of Clar and Fries numbers;Discrete Mathematics;2024-11

2. Total graph of a lattice;Indian Journal of Pure and Applied Mathematics;2024-03-28

3. Finding triangle‐free 2‐factors in general graphs;Journal of Graph Theory;2024-03-08

4. On the comaximal graph of a ring;AKCE International Journal of Graphs and Combinatorics;2024-02-06

5. Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies;International Journal of Game Theory;2023-10-10