On extremal sets of nodes in bipartite graphs
Časopis pro pěstování matematiky (1967)
- Volume: 092, Issue: 4, page 443-448
- ISSN: 0528-2195
Access Full Article
topHow to cite
topMorávek, Jaroslav, and Randl, Pavel. "Extremální množiny uzlů v sudém grafu." Časopis pro pěstování matematiky 092.4 (1967): 443-448. <http://eudml.org/doc/20975>.
@article{Morávek1967,
author = {Morávek, Jaroslav, Randl, Pavel},
journal = {Časopis pro pěstování matematiky},
keywords = {topology},
language = {cze},
number = {4},
pages = {443-448},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Extremální množiny uzlů v sudém grafu},
url = {http://eudml.org/doc/20975},
volume = {092},
year = {1967},
}
TY - JOUR
AU - Morávek, Jaroslav
AU - Randl, Pavel
TI - Extremální množiny uzlů v sudém grafu
JO - Časopis pro pěstování matematiky
PY - 1967
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 092
IS - 4
SP - 443
EP - 448
LA - cze
KW - topology
UR - http://eudml.org/doc/20975
ER -
References
top- C. Berge, Théorie des graphes et ses applications, Paris, Dunod, 1958 (ruský překlad Moskva 1962). (1958) MR0102822
- L. R. Ford D. R. Fulkerson, Flows in Networks, 1962, Princeton, New Jersey (ruský překlad: Moskva 1966). (1966)
- M. Iri, A new method of solving transportation network problems, J. Oper. Res. Soc. Japan, Vol. 3, No 1 and 2, October, 1960. (1960)
- 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. (1965) MR0180381
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.