|
|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
| 1. |
A. S. Gusev, “Clique numbers of random subgraphs of some distance graphs”, Probl. Peredachi Inf., 54:2 (2018), 73–85   ; Problems Inform. Transmission, 54:2 (2018), 165–175   |
|
2015 |
| 2. |
A. S. Gusev, “New Upper Bound for the Chromatic Numberof a Random Subgraph of a Distance Graph”, Mat. Zametki, 97:3 (2015), 342–349   ; Math. Notes, 97:3 (2015), 326–332 |
8
|
| 3. |
L. I. Bogolubsky, A. S. Gusev, M. M. Pyaderkin, A. M. Raigorodskii, “Independence numbers and chromatic numbers of the random subgraphs of some distance graphs”, Mat. Sb., 206:10 (2015), 3–36 ; Sb. Math., 206:10 (2015), 1340–1374 |
28
|
|
| Organisations |
|
|
Contact us: