This article is cited 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.

UDC: 51.01.14

Received: 04.03.1968

 English version: Mathematical Notes, 1969, 6:2, 583–588

Bibliographic databases:

• 
•