RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
2000
Volume 7,
Issue 2,
Pages
21–46
(Mi da260)
This article is cited in
3
papers
On the complexity of determining a connected prescribed coloring of the vertices of a graph
A. V. Kononov
,
S. V. Sevast'yanov
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.174
Received:
01.11.1999
Fulltext:
PDF file (2909 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024