Diskretn. Anal. Issled. Oper., Series 1, 2002, Volume 9, Number 1

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Series 1, 2002, Volume 9, Number 1

	On the continuation of a 3-coloring from two vertices in a plane graph without 3-cycles V. A. Aksenov, O. V. Borodin, A. N. Glebov		3
	A bipartite interpretation of a directed multigraph in problems of the coloring of incidentors V. G. Vizing		27
	On partitions of Hamming codes into disjoint components S. A. Malyugin, A. M. Romanov		42
	$(k,l)$-coloring of incidentors of cubic multigraphs A. V. Pyatkin		49
	On a relation between lower bounds for the complexity of schemes of functional elements and the minimal covering problem K. L. Rychkov		54
	On the entropy of compositions of hereditary classes of colored graphs S. V. Sorochan		59
	On the complexity of the realization of products of Boolean functions by formulas D. Yu. Cherukhin		84