|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
A. L. Perezhogin, I. S. Bykov, S. V. Avgustinovich, “Small length circuits in Eulerian orientations of graphs”, Sib. Èlektron. Mat. Izv., 21:1 (2024), 370–382  |
|
2019 |
| 2. |
I. S. Bykov, “$2$-Factors without close edges in the $n$-dimensional cube”, Diskretn. Anal. Issled. Oper., 26:3 (2019), 5–26 ; J. Appl. Industr. Math., 13:3 (2019), 405–417  |
|
2017 |
| 3. |
I. S. Bykov, A. L. Perezhogin, “On distance Gray codes”, Diskretn. Anal. Issled. Oper., 24:2 (2017), 5–17  ; J. Appl. Industr. Math., 11:2 (2017), 185–192 |
2
|
|
2016 |
| 4. |
I. S. Bykov, “On locally balanced Gray codes”, Diskretn. Anal. Issled. Oper., 23:1 (2016), 51–64  ; J. Appl. Industr. Math., 10:1 (2016), 78–85 |
7
|
|
2014 |
| 5. |
I. S. Bykov, “Functioning of discrete dynamic circulant-type system with threshold functions”, Prikl. Diskr. Mat., 2014, no. 4(26), 84–95 |
4
|
| 6. |
I. S. Bykov, “On cycles in functional graphs of circulant type gene networks with threshold functions”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 122–124 |
|
| Organisations |
|
| |
|
|
Contact us: