Skip to main content
SpringerLink
Log in

Algorithms for testing certain graph properties

  • 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. A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Sibirsk. Otd. Akad. Nauk SSSR, Novosibirsk (1969).

    Google Scholar 

  2. C. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton (1974).

    Google Scholar 

  3. S. E. Markosyan, “On the coloring of the vertices of an interval graph,” in: Questions of Radioelectronics, Series EVT [in Russian], No. 4, Moscow (1972).

  4. C. Berge, The Theory of Graphs and Its Applications, Methuen, London (1962).

    Google Scholar 

  5. A. G. Markosyan, “On the number of internal stabilities in the Cartesian product of graphs,” Dokl. Akad. Nauk. ArmSSR,52, No. 1 (1971).

    Google Scholar 

Download references

Authors
  1. A. G. Markosyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. E. Markosyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 76–81, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Markosyan, A.G., Markosyan, S.E. Algorithms for testing certain graph properties. Cybern Syst Anal 12, 252–258 (1976). https://doi.org/10.1007/BF01069895

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation