This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. I. Zhuravlev, “Local algorithms of computation of information, II.” Kibernetika, No. 2 (1966).
Yu. I. Zhuravlev, “Estimates of complexity of algorithms of construction of minimal disjunctive normal forms for functions of the algebra of logic” in: Discrete Analysis, No. 3, Novosibirsk (1964).
V. V. Glagolev, “Some estimates of disjunctive normal forms of functions of the algebra of logic,” Problemy Kibernetiki, No. 19, Moscow (1967).
R. Z. Norman and M. O. Rabin, “An algorithm for a minimum cover of a graph,” Notices of the American Mathematical Society,5 (1958).
T. L. Maistrova, “Minimal cover of a graph,” Proceedings Third All-Union Conference on Automatic Control (Engineering Cybernetics), Nauka, Moscow (1967).
J. Edmonds, “Covers and packings in a family of sets,” Bulletin of the American Mathematical Society,68, No. 5 (1962).
R. G. Nigmatullin, “Cover of a graph by edges,” Problemy Kibernetiki, Fizmatgiz, Moscow (in print).
Additional information
Translated from Kibernetika, No. 2, pp. 95–98, March–April, 1970.
Rights and permissions
About this article
Cite this article
Nigmatullin, R.G. On the number of irreducible covers of a graph by edges. Cybern Syst Anal 6, 120–123 (1970). https://doi.org/10.1007/BF01070509
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070509