For citations:

Medvedeva N.S., Smirnov A.V. NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem. Modeling and Analysis of Information Systems. 2019;26(3):405-419. (In Russ.) https://doi.org/10.18255/1818-1015-2019-3-405-419