Skip to main content
Log in

Yet another method of enumerating unmarked combinatorial objects

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature cited

  1. R. I. Tyshkevich, “Algebraic approach to the problem of graph theory,” Doctoral Thesis in Phys.-Math. Sciences, Kiev (1983).

  2. F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York (1973).

    Google Scholar 

  3. S. Foldes and P. L. Hammer, “Split graphs,” Proc. 8-th South-Eastern Conference on Combinatoris, Graph Theory and Computing, Util. Math., 311–315 (1977).

  4. J. W. Moon, Topics in Tournaments, Holt, Rinehart, Winston, New York (1968).

    Google Scholar 

  5. R. I. Tyshkevich and A. A. Chernyak, “Box-threshold graphs,” in: 30th Intern. Wissensch. Koll. FH Ilmenau. Graphen und Netzwerke — Theorie und Anwendungen, Ilmenau, 119–121 (1985).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Matematicheskie Zametki, Vol. 48, No. 6, pp. 98–105, December, 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tyshkevich, R.I., Chernyak, A.A. Yet another method of enumerating unmarked combinatorial objects. Mathematical Notes of the Academy of Sciences of the USSR 48, 1239–1245 (1990). https://doi.org/10.1007/BF01240267

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation