|
|
|
Publications in Math-Net.Ru |
Citations |
|
2021 |
| 1. |
P. V. Razumovsky, “The search for minimal edge $1$-extension of an undirected colored graph”, Izv. Saratov Univ. Math. Mech. Inform., 21:3 (2021), 400–407   |
1
|
| 2. |
P. V. Razumovskii, M. B. Abrosimov, “Generation of colored graphs with isomorphism rejection”, Izv. Saratov Univ. Math. Mech. Inform., 21:2 (2021), 267–277  |
2
|
| 3. |
M. B. Abrosimov, P. V. Razumovskii, “Finding minimal vertex extensions of a colored undirected graph”, University proceedings. Volga region. Physical and mathematical sciences, 2021, no. 4, 106–117 |
1
|
| 4. |
P. V. Razumovskii, M. B. Abrosimov, “Schemes for constructing minimal vertex $1$-extensions of complete bicolored graphs”, Prikl. Diskr. Mat. Suppl., 2021, no. 14, 165–168 |
| 5. |
P. V. Razumovsky, M. B. Abrosimov, “The minimal vertex extensions for colored complete graphs”, Vestn. Yuzhno-Ural. Gos. Un-ta. Ser. Matem. Mekh. Fiz., 13:4 (2021), 77–89 |
|
2019 |
| 6. |
M. B. Abrosimov, P. V. Razumovskii, “About non-isomorphic graph colouring generating by Read–Faradzhev method”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 173–176 |
1
|
|
2017 |
| 7. |
M. B. Abrosimov, P. V. Razumovsky, “About generation of non-isomorphic vertex $k$-colorings”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 136–138 |
2
|
|
| Organisations |
|
| |
|
|
Contact us: