Voir la notice de l'article provenant de la source Math-Net.Ru
@article{SVMO_2024_26_1_a0, author = {V. E. Alekseev and D. V. Zakharova}, title = {On linear spaces of bipartite graphs}, journal = {\v{Z}urnal Srednevol\v{z}skogo matemati\v{c}eskogo ob\^{s}estva}, pages = {11--19}, publisher = {mathdoc}, volume = {26}, number = {1}, year = {2024}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/SVMO_2024_26_1_a0/} }
V. E. Alekseev; D. V. Zakharova. On linear spaces of bipartite graphs. Žurnal Srednevolžskogo matematičeskogo obŝestva, Tome 26 (2024) no. 1, pp. 11-19. http://geodesic.mathdoc.fr/item/SVMO_2024_26_1_a0/
[1] V. A. Emelichev, O. I. Melnikov, V. I. Sarvanov, R. I. Tyshkevich, Lektsii po teorii grafov, Nauka, M., 1990, 384 pp. | MR
[2] A. A. Zykov, Osnovy teorii grafov, Nauka, M., 1987, 383 pp.
[3] V. E. Alekseev, D. V. Zakharova, “O simmetricheskikh prostranstvakh grafov”, Diskretnyi analiz i issledovanie operatsii, 14:1 (2007), 24-26 | MR | Zbl
[4] D. V. Zakharova, “Simmetricheskie lineinye prostranstva grafov”, Diskretnaya matematika, 23:2 (2011), 104-107 | DOI
[5] V. E. Alekseev, V. A. Talanov, Grafy. Modeli vychislenii. Algoritmy, N. Novgorod Izd-vo Nizhegor. uni-ta im N.I.Lobachevskogo, 2005, 308 pp.
[6] V. E. Alekseev, V. A. Talanov, Grafy i algoritmy. Struktury dannykh.Modeli vychislenii., M. INTUIT, 2006, 319 pp.
[7] V. E. Alekseev, D. V. Zakharova, Teoriya grafov, N. Novgorod Izd-vo Nizhegor. uni-ta im N.I.Lobachevskogo, 2018, 118 pp.
[8] V. E. Alekseev, Issledovanie kolichestvennykh i slozhnostnykh kharakteristik nasledstvennykh klassov grafov, na soisk. d-ra fiz.-mat. nauk, N. Novgorod, 2002, 113 pp.