Skip to main content
SpringerLink
Log in

Construction of all Hamiltonian paths in tournaments

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. C. Berge, Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962); English edition: Barnes and Noble, New York (1962).

    Google Scholar 

  2. A. Kaufmann, Introduction to Applied Combinatorics [Russian translation], Nauka, Moscow (1965).

    Google Scholar 

  3. V. Ya. Burdyuk, “Regular g-orderings and Smith functions,” Kibernetika, No. 2 (1975).

  4. V. V. Shkurba, “Succession intervals in ordering problems,” Kibernetika, No. 2 (1970).

  5. V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  6. J. C. Tiernan, “An efficient search algorithm to find the elementary circuits of a graph,” Commun. ACM,13, No. 12 (1970).

  7. S. Walukiewisz, “Algebraiczne kryterium isnienia marszruty Hamiltona w grafie skonczonum,” Arch. Automat. Telemech.,16, No. 2 (1971).

  8. V. P. Kozyrev, “Graph theory,” J. Sov. Math.,2, No. 5, 489 (1974).

    Google Scholar 

  9. J. W. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York-Montreal-Quebec-London (1968).

    Google Scholar 

  10. G. Pólya, Mathematics and Plausible Reasoning, Vols. 1 and 2, Princeton University Press, Princeton, New Jersey (1954, 1959).

    Google Scholar 

Download references

Authors
  1. V. Ya. Burdyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Kakhichko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. V. Shcherbak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 65–68, March–April, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdyuk, V.Y., Kakhichko, A.A. & Shcherbak, V.V. Construction of all Hamiltonian paths in tournaments. Cybern Syst Anal 14, 220–223 (1978). https://doi.org/10.1007/BF01069354

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation