Skip to main content
SpringerLink
Log in

A circuit-free orientation of the edges of a graph

  • 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, Novosibirsk (1969).

    Google Scholar 

  2. D. J. Rose, “Triangulated graphs and the elimination process,” J. Math. Anal. Appl.,32, No. 3, 597 (1970).

    Google Scholar 

  3. D. Ya. Kesel'man “On the enumeration of vertices of a graph,” in: Algebra [in Russian], No. 2, Irkutsk (1973).

Download references

Authors
  1. D. Ya. Kesel'man
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 83–90, March–April, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kesel'man, D.Y. A circuit-free orientation of the edges of a graph. Cybern Syst Anal 14, 240–246 (1978). https://doi.org/10.1007/BF01069358

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation