Skip to main content
SpringerLink
Log in

Simultaneous calculation of the numbers of incomplete colorings and partial contractions 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

References

  1. A. A. Zykov, “Some properties of linear complexes,” Matematicheskii sbornik, Moscow, 24, no. 2, 1949; American Mathematical Society Translation, no. 79, 1952.

    Google Scholar 

  2. A. A. Zykov, “Functions of graphs, defined by linear equations. Communication 1,” Izvestiya Sibirskogo otdeleniya AN SSSR, no. 5, 1959.

  3. A. A. Zykov, “Recursively Calculable Functions of Graphs,” Theory of Graphs and its Applications (Proc. Symp. Smolenice, 1963), Prague, 99–105, 1964.

  4. K. Wagner, “Beweis einer Abschwachung der Hadwiger-Vermutung,” Math. Ann., 153, no. 2, 139–141, 1964.

    Google Scholar 

  5. Kh. N. Narzullaev, “The number of incomplete colorings of the vertices of a graph,” Kibernetika [Cybernetics], Kiev, no. 2, 1968.

Download references

Authors
  1. A. A. Zykov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 4, No. 5, pp. 58–62, 1968

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zykov, A.A. Simultaneous calculation of the numbers of incomplete colorings and partial contractions of a graph. Cybern Syst Anal 4, 46–48 (1968). https://doi.org/10.1007/BF01077173

Download citation

  • Issue Date:

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

Keywords

Search

Navigation