|
|
|
Publications in Math-Net.Ru |
Citations |
|
1971 |
| 1. |
M. K. Gol'dberg, “Нечетные циклы мультиграфа с большим хроматическим классом”, Upravliaemie systemy, 1971, no. 10, 45–47  |
|
1969 |
| 2. |
M. K. Gol'dberg, “Оценки для радиуса и диаметра сильно связного графа”, Upravliaemie systemy, 1969, no. 2, 92–99 |
|
1968 |
| 3. |
M. K. Gol'dberg, É. M. Livshits, “On minimal universal trees”, Mat. Zametki, 4:3 (1968), 371–380  ; Math. Notes, 4:3 (1968), 713–717 |
4
|
|
1966 |
| 4. |
M. K. Gol'dberg, “On the diameter of a strongly connected graph”, Dokl. Akad. Nauk SSSR, 170:4 (1966), 767–769  |
|
1965 |
| 5. |
M. K. Gol'dberg, “Some applications of the operation of contraction to strongly connected graphs”, Uspekhi Mat. Nauk, 20:5(125) (1965), 203–205 |
|
| Organisations |
|
|
Contact us: