5 citations to https://www.mathnet.ru/eng/endm1
  1. M. Akhmejanova, D. A. Shabanov, “Equitable Colorings of Hypergraphs with r Colors”, J Math Sci, 262:4 (2022), 391  crossref
  2. A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146  mathnet  mathnet  crossref  crossref  isi  scopus
  3. D. A. Shabanov, T. M. Shaikheeva, “The List-Chromatic Number of Complete Multipartite Hypergraphs and Multiple Covers by Independent Sets”, Math. Notes, 107:3 (2020), 499–508  mathnet  mathnet  crossref  crossref  isi  scopus
  4. Margarita B. Akhmejanova, Dmitry A. Shabanov, “Equitable colorings of hypergraphs with few edges”, Discrete Applied Mathematics, 276 (2020), 2  crossref
  5. Dmitry Kravstov, Nikolay Krokhmal, Dmitry Shabanov, “Panchromatic 3-colorings of random hypergraphs”, European J. Combin., 78 (2019), 28–43  mathnet  crossref  isi  scopus