Literature cited
R. I. Tyshkevich, “Algebraic approach to the problem of graph theory,” Doctoral Thesis in Phys.-Math. Sciences, Kiev (1983).
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York (1973).
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).
J. W. Moon, Topics in Tournaments, Holt, Rinehart, Winston, New York (1968).
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).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 48, No. 6, pp. 98–105, December, 1990.
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01240267