Raspaud A

Publications in Math-Net.Ru

1. Planar graphs without triangles adjacent to cycles of length from $3$ to $9$ are $3$-colorable
   
   Sib. Èlektron. Mat. Izv., 3 (2006),  428–440
2. Estimating the Minimal Number of Colors in Acyclic -Strong Colorings of Maps on Surfaces
   
   Mat. Zametki, 72:1 (2002),  35–37
3. Acyclic $k$-strong coloring of maps on surfaces
   
   Mat. Zametki, 67:1 (2000),  36–45
4. Acyclic coloring of 1-planar graphs
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  20–35