- Ю А Демидович, Yu A Demidovich, “Двухцветные раскраски гиперграфов с большим обхватом”, Математические заметки, 108, no. 2, 2020, 200
- P. A. Ogarok, A. M. Raigorodskii, “On Stability of the Independence Number of a Certain Distance Graph”, Probl Inf Transm, 56, no. 4, 2020, 345
- Arturo Merino, Torsten Mütze, Namrata, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 963
- Mikhail Ipatov, “Exact modularity of line graphs of complete graphs”, Moscow J. Comb. Number Th., 10, no. 1, 2021, 61
- K. D. Kovalenko, A. M. Raigorodsky, “Systems of Representatives”, Math Notes, 106, no. 3-4, 2019, 372
- A. M. Raigorodskii, M. M. Koshelev, “New Bounds for the Clique-Chromatic Numbers of Johnson Graphs”, Dokl. Math., 101, no. 1, 2020, 66
- Aida Abiad, Robin Simoens, Sjanne Zeijlemaker, “On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme”, Discrete Applied Mathematics, 348, 2024, 221
- Kirill Kovalenko, “On the independence number and the chromatic number of generalized preferential attachment models”, Discrete Applied Mathematics, 285, 2020, 301
- Yu. A. Demidovich, D. A. Shabanov, “On Two Limit Values of the Chromatic Number of a Random Hypergraph”, Theory Probab. Appl., 67, no. 2, 2022, 175
- D. A. Shabanov, T. M. Shaikheeva, “The List-Chromatic Number of Complete Multipartite Hypergraphs and Multiple Covers by Independent Sets”, Math Notes, 107, no. 3-4, 2020, 499