- Mikhail M. Koshelev, “Lower bounds on the clique-chromatic numbers of some distance graphs”, Moscow J. Comb. Number Th., 10, no. 2, 2021,
141 
- A. M. Raigorodskii, M. M. Koshelev, “New Bounds for the Clique-Chromatic Numbers of Johnson Graphs”, Dokl. Math., 101, no. 1, 2020,
66 - Swee Hong Chan, Igor Pak, “Computational complexity of counting coincidences”, Theoretical Computer Science, 1015, 2024,
114776