Skip to main content
Log in

On König's theorem

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. D. König, Theorie der endlichen und unendlichen Graphen, Chelsea, New York (1950).

    Google Scholar 

  2. M. Hall, Combinatorial Theory, Blaisdell, Waltham, Massachusetts (1967).

    Google Scholar 

  3. L. Mirsky and H. Perfect, J. Math. Anal. Appl.,15 (1966).

  4. M. M. Flood, Proc. Symposium Appl. Math.,10 (1960).

  5. P. Hall, J. London Math. Soc.,10 (1935).

  6. D. A. Suprunenko and N. N. Metel'skii, “The assignment problem and the minimization of the sum of linear forms on a symmetric group,” Kibernetika, No. 3 (1973).

  7. R. C. Entringer and D. E. Jackson, Archiv Mathematik,20, No. 2 (1969).

  8. Detlet Wille, Archiv Mathematik,25, No. 2 (1974).

Download references

Authors

Additional information

Translated from Kibernetika, No. 4, pp. 128–133, July–August, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Suprunenko, L.A. On König's theorem. Cybern Syst Anal 11, 652–658 (1975). https://doi.org/10.1007/BF01070444

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070444

Keywords

Navigation