1. Azamov, A.A., On an alternative for differential pursuit–evasion games on an
infinite time horizon, Prikl. Mat. Mekh., 1986, vol. 50,
no. 4, pp. 561–566.
2. Azamov, A.A., Lower bound for the advantage coefficient in the search
problem on graphs, Differ. Equations, 2008, vol. 44,
no. 12, pp. 1764–1767.
3. Azamov, A.A., Kuchkarov, A.Sh., and Kholboev, A.G., The pursuit-evasion
game on the 1-skeleton graph of a regular polyhedron. Part I: Autom.
Remote Control, 2017, vol. 78, pp. 754–761; Part II: Autom. Remote Control, 2019. V. 80. N. .
P. 164–170.
4. Bulgakova, M.A. and Petrosyan, L.A., Multimove games with pairwise
interaction on a complete graph, Mat. Teoriya Igr Pril.,
2019, vol. 11, no. 1, pp. 3–20.
5. Kelley, J.L., General Topology, New
York: Van Nostrand Reinhold, 1955. Translated under the title: Obshchaya topologiya, Moscow:
Fizmatgiz, 1968.