Previous |  Up |  Next

Article

Title: Extremální množiny uzlů v sudém grafu (Czech)
Title: On extremal sets of nodes in bipartite graphs (English)
Title: Über die maximalen Mengen der Knotenpunkte eines paaren Graphen (German)
Author: Morávek, Jaroslav
Author: Randl, Pavel
Language: Czech
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 92
Issue: 4
Year: 1967
Pages: 443-448
Summary lang: English
Summary lang: Russian
.
Category: math
.
MSC: 05-40
idZBL: Zbl 0165.26505
idMR: MR0234856
DOI: 10.21136/CPM.1967.117609
.
Date available: 2009-09-23T07:56:24Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/117609
.
Reference: [1] C. Berge: Théorie des graphes et ses applications.Paris, Dunod, 1958 (ruský překlad Moskva 1962). MR 0102822
Reference: [2] L. R. Ford D. R. Fulkerson: Flows in Networks.1962, Princeton, New Jersey (ruský překlad: Moskva 1966).
Reference: [3] M. Iri: A new method of solving transportation network problems.J. Oper. Res. Soc. Japan, Vol. 3, No 1 and 2, October, 1960.
Reference: [4] R. Kurata: Primal dual method of parametric programming and Iri's theory on network flow problems.J. Oper. Research Soc. Jap., vol. 7, February 1965, No 3. MR 0180381
.

Files

Files Size Format View
CasPestMat_092-1967-4_5.pdf 958.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo