Skip to main content
SpringerLink
Log in

A recurrence formula related to the contractions of a graph

  • Published:
Siberian Mathematical Journal 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. A. A. Zykov, “Simultaneous calculation of the numbers of incomplete colorations of vertices and partial contractions of a graph,” Kibernetika, No. 5, 58–62, (1968).

    Google Scholar 

  2. C. Berge, The Theory of Graphs and Their Application [Russian translation], Izd. Inostr. Lit., Moscow (1962).

    Google Scholar 

  3. V. V. Matyushkov, “A study of the information conveyed about graphs defined by recurrence relations,” Kibernetika, No. 5, 90–94 (1965).

    Google Scholar 

  4. A. A. Zykov, “Functions of graphs defined by linear equations,” Izv. SO AN SSSR, No. 5, 3–19 (1959); No. 9, 17–33 (1960); No. 12, 13–27 (1960).

    Google Scholar 

Download references

Authors
  1. V. V. Matyushkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 11, No. 4, pp. 822–842, July–August, 1970.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Matyushkov, V.V. A recurrence formula related to the contractions of a graph. Sib Math J 11, 621–635 (1970). https://doi.org/10.1007/BF00969677

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation