Skip to main content
SpringerLink
Log in

Bijoin points, bibridges, and biblocks of directed graphs

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

    Google Scholar 

  2. A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Novosibirsk (1969).

    Google Scholar 

Download references

Authors
  1. Ya. M. Erusalimskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. G. Svetlov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 37–39, January–February, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erusalimskii, Y.M., Svetlov, G.G. Bijoin points, bibridges, and biblocks of directed graphs. Cybern Syst Anal 16, 41–44 (1980). https://doi.org/10.1007/BF01099359

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation