Skip to main content
SpringerLink
Log in

Self-nonintersecting and non intersecting chains

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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. F. Harary, Graph Theory, Addison-Wesley (1969).

  2. R. Basaker and T. Saaty, Finite Graphs and Nets [Russian translation], Nauka, Moscow (1974).

    Google Scholar 

  3. O. Ore, Theory of Graphs, Amer. Math. Soc. (1974).

Download references

Author information

Authors and Affiliations

  1. Kiev State University, USSR

    S. B. Belyi

Authors
  1. S. B. Belyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 34, No. 4, pp. 625–628, October, 1983.

The author thanks A. A. Zykov and N. P. Khomenko for discussion of the results and valuable comments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Belyi, S.B. Self-nonintersecting and non intersecting chains. Mathematical Notes of the Academy of Sciences of the USSR 34, 802–804 (1983). https://doi.org/10.1007/BF01157400

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation