Skip to main content
SpringerLink
Log in

Covering a graph by a set of paths originating at a single vertex

  • 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, The Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962).

    Google Scholar 

  2. V. G. Vizing and M. K. Gol'dberg, “The length of a circuit of a strongly connected graph,” Kibernetika, No. 1 (1969).

Download references

Authors
  1. I. S. Grunskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. V. Speranskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 29–34, Junuary–February, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grunskii, I.S., Speranskii, D.V. Covering a graph by a set of paths originating at a single vertex. Cybern Syst Anal 10, 34–40 (1974). https://doi.org/10.1007/BF01069015

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation