1. Korsakov, S.V., Smirnov, A.V., and Sokolov, V.A., Principles of organizing the interoperability of equipollent nodes in a wireless mesh-network with time division multiple access, Autom. Control Comput. Sci., 2016, vol. 50, no. 6, pp. 415–422. https://doi.org/10.3103/s0146411616060031
2. Harary, F., Graph Theory, Addison-Wesley, 1969.
3. Medvedeva, N.S. and Smirnov, A.V., NP-completeness and one polynomial subclass of the two-step graph coloring problem, Autom. Control Comput. Sci., 2020, vol. 54, no. 7, pp. 685–696. https://doi.org/10.3103/s0146411620070159
4. Medvedeva, N. and Smirnov, A., Dvukhshagovaya raskraska pryamougol’nogo grafa reshetki, Zametki po informatike i matematike (Notes on Informatics and Mathematics), Yaroslavl: Yaroslavl. Gos. Univ., 2019, vol. 11, pp. 131–138.
5. Kolmogorov, A.N., Parquets made of regular polygons, Kvant, 1970, no. 3, pp. 24–27.