|
Matematicheskie Zametki, 1969, Volume 6, Issue 2, Pages 213–223
(Mi mzm6925)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On the Redfield-Read combinatory algorithm
I. È. Mullat Research Institute for Applied Mathematics and Cybernetics, N. I. Lobachevski State University of Gorkii
Abstract:
This note is devoted to a generalization of the Redfield-Read superposition theorem. Several ways of using this theorem in the generalized form are cited, after which, by way of illustration, a problem of graph enumeration is solved.
Received: 04.03.1968
Citation:
I. È. Mullat, “On the Redfield-Read combinatory algorithm”, Mat. Zametki, 6:2 (1969), 213–223; Math. Notes, 6:2 (1969), 583–588
Linking options:
https://www.mathnet.ru/eng/mzm6925 https://www.mathnet.ru/eng/mzm/v6/i2/p213
|
Statistics & downloads: |
Abstract page: | 218 | Full-text PDF : | 114 | First page: | 1 |
|