|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
D. V. Sirotkin, D. S. Malyshev, “A constructive existence theorem related to local transformations of graphs for the independent set problem”, Zhurnal SVMO, 21:2 (2019), 215–221   |
|
2018 |
| 2. |
D. V. Sirotkin, D. S. Malyshev, “On the complexity of the vertex $3$-coloring problem for the hereditary graph classes with forbidden subgraphs of small size”, Diskretn. Anal. Issled. Oper., 25:4 (2018), 112–130 ; J. Appl. Industr. Math., 12:4 (2018), 759–769  |
5
|
| 3. |
D. V. Sirotkin, “On the complexity for constructing a 3-colouring for planar graphs with short facets”, Zhurnal SVMO, 20:2 (2018), 199–205 |
1
|
|
2017 |
| 4. |
D. S. Malyshev, D. V. Sirotkin, “Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs”, Diskretn. Anal. Issled. Oper., 24:3 (2017), 35–60 ; J. Appl. Industr. Math., 11:3 (2017), 400–414 |
3
|
| 5. |
D. V. sirotkin, D. S. Malyshev, “A method of graph reduction and its applications”, Diskr. Mat., 29:3 (2017), 114–125 ; Discrete Math. Appl., 28:4 (2018), 249–258  |
1
|
| 6. |
D. V. sirotkin, “Theorems of existence and sufficiency connected with local transformations of graphs for the $k$-colourability problem”, Zhurnal SVMO, 19:2 (2017), 98–104 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: