Geodesic
On the Redfield-Read combinatory algorithm
Matematičeskie zametki, Tome 6 (1969) no. 2, pp. 213-223

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MZM_1969_6_2_a9,
     author = {I. \`E. Mullat},
     title = {On the {Redfield-Read} combinatory algorithm},
     journal = {Matemati\v{c}eskie zametki},
     pages = {213--223},
     publisher = {mathdoc},
     volume = {6},
     number = {2},
     year = {1969},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1969_6_2_a9/}
}
TY  - JOUR
AU  - I. È. Mullat
TI  - On the Redfield-Read combinatory algorithm
JO  - Matematičeskie zametki
PY  - 1969
SP  - 213
EP  - 223
VL  - 6
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1969_6_2_a9/
LA  - ru
ID  - MZM_1969_6_2_a9
ER  - 
%0 Journal Article
%A I. È. Mullat
%T On the Redfield-Read combinatory algorithm
%J Matematičeskie zametki
%D 1969
%P 213-223
%V 6
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1969_6_2_a9/
%G ru
%F MZM_1969_6_2_a9
I. È. Mullat. On the Redfield-Read combinatory algorithm. Matematičeskie zametki, Tome 6 (1969) no. 2, pp. 213-223. http://geodesic.mathdoc.fr/item/MZM_1969_6_2_a9/