Skip to main content
SpringerLink
Log in

An approach to the problem of color patterns of plane graphs. I

  • 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. G. A. Donets, “On the number of color patterns of certain T-graphs,” in: Theory of Optimal Solutions [in Russian], No. 4, Izd. IK Akad. Ukr. SSR, Kiev (1969).

    Google Scholar 

  2. J. Riordan, An Introduction to Combinatorial Analysis, Wiley (1958).

  3. A. A. Zykov, “On a polynomial characteristic of linear complexes,” in: Proceedings of the 3rd All-Union Mathematical Congress [in Russian], Vol. 2, Izd. ANP SSSR, Moscow (1956).

    Google Scholar 

  4. A. A. Zykov, “Functions of graphs given by linear equations. Report 1,” Izv. Sibirsk. Otdel. Akad. Nauk SSSR, 5 (1959).

  5. A. A. Zykov, “Edge-vertex functions and distributive properties of graphs,” Dokl. Akad. Nauk SSSR, 139, No. 4, Moscow (1961).

  6. L. M. Vitaver, “On a vertex-edge function of graphs,” Uspek. Matemat. Nauk,23, No. 6, Moscow (1962).

Download references

Authors
  1. G. A. Donets
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 108–114, July–August, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Donets, G.A. An approach to the problem of color patterns of plane graphs. I. Cybern Syst Anal 8, 652–659 (1972). https://doi.org/10.1007/BF01068288

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation