Kel'mans A K

Publications in Math-Net.Ru

1. Matroids and the theorems of Whitney on $2$-isomorphism and planarity of graphs
   
   Uspekhi Mat. Nauk, 43:5(263) (1988),  199–200
2. Cubic bipartite cyclic $4$-connected graphs without Hamiltonian circuits
   
   Uspekhi Mat. Nauk, 43:3(261) (1988),  181–182
3. $3$-connected graphs without essential $3$-cuts and triangles
   
   Dokl. Akad. Nauk SSSR, 288:3 (1986),  531–535
4. 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
5. Homeomorphic imbeddings of graphs with given properties
   
   Dokl. Akad. Nauk SSSR, 274:6 (1984),  1298–1303
6. On Minimal Matroid Coverings
   
   Probl. Peredachi Inf., 12:3 (1976),  94–107
7. Asymptotic formulas for the probability of $k$-connectedness of random graphs
   
   Teor. Veroyatnost. i Primenen., 17:2 (1972),  253–265