|
|
|
Publications in Math-Net.Ru |
Citations |
|
1988 |
| 1. |
A. K. Kel'mans, “Matroids and the theorems of Whitney on $2$-isomorphism and planarity of graphs”, Uspekhi Mat. Nauk, 43:5(263) (1988), 199–200    ; Russian Math. Surveys, 43:5 (1988), 239–241  |
| 2. |
A. K. Kel'mans, “Cubic bipartite cyclic $4$-connected graphs without Hamiltonian circuits”, Uspekhi Mat. Nauk, 43:3(261) (1988), 181–182 ; Russian Math. Surveys, 43:3 (1988), 205–206 |
3
|
|
1986 |
| 3. |
A. K. Kel'mans, “$3$-connected graphs without essential $3$-cuts and triangles”, Dokl. Akad. Nauk SSSR, 288:3 (1986), 531–535 |
|
1985 |
| 4. |
A. K. Kel'mans, “The existence of a “most complex” problem in the class of
problems verifiable in nonpolynomial time”, Dokl. Akad. Nauk SSSR, 282:6 (1985), 1299–1303 |
|
1984 |
| 5. |
A. K. Kel'mans, “Homeomorphic imbeddings of graphs with given properties”, Dokl. Akad. Nauk SSSR, 274:6 (1984), 1298–1303 |
|
1976 |
| 6. |
A. K. Kel'mans, M. V. Lomonosov, V. P. Polesskii, “On Minimal Matroid Coverings”, Probl. Peredachi Inf., 12:3 (1976), 94–107 ; Problems Inform. Transmission, 12:3 (1976), 231–241 |
1
|
|
1972 |
| 7. |
A. K. Kel'mans, “Asymptotic formulas for the probability of $k$-connectedness of random graphs”, Teor. Veroyatnost. i Primenen., 17:2 (1972), 253–265 ; Theory Probab. Appl., 17:2 (1973), 243–254 |
19
|
| |
|
|
Contact us: