Archiv der Mathematik

, Volume 27, Issue 1, pp 668–672 | Cite as

Minimum block containing a given graph

  • Ján Pleseník


Minimum Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. T. Chien, Synthesis of a communication net. IBM J. Res. Develop.4, 311–320 (1960).Google Scholar
  2. [2]
    R. E. Gomory andT. C. Hu, Multi-terminal network flows. J. Soc. Indust. Appl. Math.9, 551–570 (1961).Google Scholar
  3. [3]
    F.Harary, Graph theory. Reading 1969.Google Scholar
  4. [4]
    L.Lovász, Lecture given at the Second Czechoslovak Symposium on Graph Theory. Prague 1974.Google Scholar
  5. [5]
    W. Mayeda, Terminal and branch capacity matrices of a communication net. IRE Trans. Circuit Theory7, 251–269 (1960).Google Scholar
  6. [6]
    O.Ore, Theory of graphs. Providence 1962.Google Scholar

Copyright information

© Birkhäuser Verlag 1976

Authors and Affiliations

  • Ján Pleseník
    • 1
  1. 1.Matematický pavilónKomensky UniversityBratislavaCzechoslovakia

Personalised recommendations