|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
S. V. Sorochan, “New cases of polynomial solvability of the independent set problem for graphs with forbidden triods”, Diskretn. Anal. Issled. Oper., 30:1 (2023), 85–109   |
|
2018 |
| 2. |
V. E. Alekseev, S. V. Sorochan, “New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths”, Diskretn. Anal. Issled. Oper., 25:2 (2018), 5–18  ; J. Appl. Industr. Math., 12:2 (2018), 213–219  |
2
|
|
2009 |
| 3. |
V. E. Alekseev, S. V. Sorochan, “On the entropy minimal hereditary classes of coloured graphs”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 19–25  ; J. Appl. Industr. Math., 4:2 (2010), 143–146 |
|
2005 |
| 4. |
S. V. Sorochan, “Characterization and recognition of digraphs from hereditary classes, minimal with respect to inclusion, with the lowest positive entropy value”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005), 12–55 |
|
2003 |
| 5. |
S. V. Sorochan, “On regular compositions of hereditary classes of colored graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:1 (2003), 79–104 |
2
|
|
2002 |
| 6. |
S. V. Sorochan, “On the entropy of compositions of hereditary classes of colored graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002), 59–83 |
3
|
|
2000 |
| 7. |
V. E. Alekseev, S. V. Sorochan, “On the entropy of hereditary classes of oriented graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 20–28 |
3
|
| 8. |
V. E. Alekseev, S. V. Sorochan, “On the entropy of hereditary classes of colored graphs”, Diskr. Mat., 12:2 (2000), 99–102 ; Discrete Math. Appl., 10:3 (2000), 273–277 |
4
|
|
| Organisations |
|
| |
|
|
Contact us: