%0 Journal Article %A N. S. Medvedeva %A A. V. Smirnov %T NP-completeness and one polynomial subclass of the two-step graph colouring problem %J Modelirovanie i analiz informacionnyh sistem %D 2019 %P 405-419 %V 26 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/item/MAIS_2019_26_3_a5/ %G ru %F MAIS_2019_26_3_a5