Yu. A. Demidovich, D. A. Shabanov, “On the chromatic numbers of random hypergraphs”, Dokl. Math., 102:2 (2020), 380–383
Margarita B. Akhmejanova, Dmitry A. Shabanov, “Equitable colorings of hypergraphs with few edges”, Discrete Applied Mathematics, 276 (2020), 2
Alexander Semenov, Dmitry Shabanov, “On the weak chromatic number of random hypergraphs”, Discrete Applied Mathematics, 276 (2020), 134
Dmitry A. Shabanov, “Estimating the r-colorability threshold for a random hypergraph”, Discrete Applied Mathematics, 282 (2020), 168
A.M. Raigorodskii, M.M. Koshelev, “New bounds on clique-chromatic numbers of Johnson graphs”, Discrete Applied Mathematics, 283 (2020), 724
D. A. Kravtsov, N. E. Krokhmal, D. A. Shabanov, “Panchromatic colorings of random hypergraphs”, Discrete Math. Appl., 31:1 (2021), 19–41
A. M. Raigorodskii, E. D. Shishunov, “On the Independence Numbers of Distance Graphs with Vertices in {–1, 0, 1}n”, Dokl. Math., 100:2 (2019), 476