RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019