Diskretn. Anal. Issled. Oper., Series 1, 2006, Volume 13, Issue 1

RUS ENG

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

Series 1, 2006, Volume 13, Issue 1

	Computational complexity of the graph approximation problem A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin		3
	Oriented 5-coloring of sparse plane graphs O. V. Borodin, A. O. Ivanova, A. V. Kostochka		16
	On the coloring of incidentors in an oriented weighted multigraph V. G. Vizing, A. V. Pyatkin		33
	On simulating the quantum and classical branching programs A. F. Gainutdinova		45
	Characterization of binary words by subwords V. K. Leont'ev, M. R. Khoshmand Asl		65
	On enumeration of nonequivalent perfect binary codes of length 15 and rank 15 S. A. Malyugin		77
	Sufficient conditions for the existence of a graph with a given variety of balls K. L. Rychkov		99