Medvedeva, N. S., & Smirnov, A. V. (2019). NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem. Yaroslavl State University.
Chicago Style (17th ed.) CitationMedvedeva, Natalya Sergeevna, and Alexander Valeryevich Smirnov. NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem. Yaroslavl State University, 2019.
MLA (9th ed.) CitationMedvedeva, Natalya Sergeevna, and Alexander Valeryevich Smirnov. NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem. Yaroslavl State University, 2019.
Warning: These citations may not always be 100% accurate.