Tyshkevich Regina Iosifovna

Publications in Math-Net.Ru

1. Hamiltonian completion
   
   Tr. Inst. Mat., 19:2 (2011),  87–90
2. Algebraic graph decomposition theory
   
   Tr. Inst. Mat., 18:1 (2010),  99–115
3. Injective $L(2,1)$-coloring of split indecomposable unigraphs
   
   Tr. Inst. Mat., 18:1 (2010),  79–91
4. Reconstruction conjecture for graphs with restrictions for 4-vertex paths
   
   Diskretn. Anal. Issled. Oper., 16:4 (2009),  87–96
5. Injective $L(2,1)$-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs
   
   Tr. Inst. Mat., 17:1 (2009),  110–118
6. On the recognition algorithm of edge intersection graphs of linear $3$-uniform hypergraphs: prelarge cliques
   
   Tr. Inst. Mat., 15:2 (2007),  78–89
7. Edge hypergraphs
   
   Diskr. Mat., 5:1 (1993),  112–129
8. Graphs with a matroid number that does not exceed 2
   
   Diskr. Mat., 2:2 (1990),  82–88
9. Yet another method of enumerating unmarked combinatorial objects
   
   Mat. Zametki, 48:6 (1990),  98–105
10. Matroid decompositions of graphs
    
    Diskr. Mat., 1:3 (1989),  129–138
11. Graph isomorphism problem.
    
    Zap. Nauchn. Sem. LOMI, 118 (1982),  83–158
12. Pronormal regular subgroups of the finite symmetric group
    
    Zap. Nauchn. Sem. LOMI, 103 (1980),  132–139
13. Relations admitting a transitive group of automorphisms
    
    Mat. Sb. (N.S.), 97(139):2(6) (1975),  262–277
14. Two theorems on solvable groups
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1962, no. 6,  45–50
15. Reducible locally nilpotent, linear groups
    
    Izv. Akad. Nauk SSSR Ser. Mat., 24:6 (1960),  787–806
16. On nilpotent linear groups
    
    Mat. Sb. (N.S.), 42(84):4 (1957),  441–444