A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
Andrey Kupavskii, Dmitry Shabanov, “Colourings of uniform hypergraphs with large girth and applications”, Comb. Probab. Comput., 27:2 (2018), 245–273
Ilia Akolzin, Dmitry Shabanov, “Colorings of hypergraphs with large number of colors”, Discrete Math., 339:12 (2016), 3020–3031
Danila D. Cherkashin, Jakub Kozik, “A note on random greedy coloring of uniform hypergraphs”, Random Struct. Alg., 47:3 (2015), 407
Dmitry A. Shabanov, “Equitable two-colorings of uniform hypergraphs”, European J. Combin., 43 (2015), 185–203
Dmitry A. Shabanov, “Coloring non-uniform hypergraphs without short cycles”, Graphs Comb., 30:5 (2014), 1249–1260
Heidi Gebauer, “On the construction of 3-chromatic hypergraphs with few edges”, Journal of Combinatorial Theory, Series A, 120:7 (2013), 1483
A. B. Kupavskii, D. A. Shabanov, “Colorings of partial Steiner systems and their applications”, J. Math. Sci., 206:5 (2015), 511–538
A. B. Kupavskii, D. A. Shabanov, “Colorings of uniform hypergraphs with large girth”, Dokl. Math., 85:2 (2012), 247–250