This is a preview of subscription content, log in via an institution to check access.
Literature cited
F. Harary, Graph Theory [Russian translation], Mir, Moscow (1973).
M. Hall, Combinatorics [Russian translation], Mir, Moscow (1970).
D. E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley (1974).
F. Harary and E. M. Palmer, Graphical Numeration, Academic Press (1973).
A. M. Kamenetskii, “Formula for the number of Hamiltonian cycles of one class of oriented graphs and its application,” in: Asymptotic and Combinatorial Analysis [in Russian], Krasnoyarsk State Univ. (1981). Dep. in VINITI April 6, 1982, No. 1610-82, pp. 28–41.
T. A. Bowling, “A q-analog of the partition lattice,” in: A Survey of Combinatorial Theory, J. N. Srivistava et al. (eds.), North-Holland (1973), pp. 101–115.
L. M. Koganov, “Number of pairs of independent partitions of a finite set,” in: Combinatorial and Asymptotic Analysis [in Russian], Krasnoyarsk State Univ. (1975), pp. 71–80.
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 41, No. 1, pp. 101–103, January, 1987.
Rights and permissions
About this article
Cite this article
Koganov, L.M. An oriented graph connected with an ordered pair of ordered partitions. Mathematical Notes of the Academy of Sciences of the USSR 41, 62–63 (1987). https://doi.org/10.1007/BF01159532
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01159532