Staff

Ivanova Anna Olegovna

Leading Researcher


Yakutsk, Kulakovskogo, 48, room 559

+7 (4112) 36-43-47

Эл. почта: ao.ivanova@s-vfu.ru

Publications

Publication Dowload Links
1. Low minor faces in 3-polytopes link
2. All tight descriptions of 3-paths in planar graphs with girth at least 9 link
3. Light 3-stars in sparse plane graphs link
4. New Results about the Structure of Plane Graphs: a Survey link
5. Low 5-stars in normal plane maps with minimum degree 5 link
6. All tight descriptions of 3-stars in 3-polytopes with girth 5 link
7. Tight descriptions of 3-paths in normal plane maps link
8. The height of faces of 3-polytopes link
9. Minimax degrees of quasiplane graphs without 4-faces link
10. Decomposing a planar graph into a forest and a subgraph of restricted maximum degree link
11. Minimax degrees of quasiplanar graphs without short cycles other than triangles link
12. List 2-arboricity of planar graphs with no triangles at distance less than two link
13. Planar graphs without triangular 4-cycles are 4-choosable link
14. 2-Distance (Delta+2)-coloring of planar graphs with girth six and Delta ge 18 link
15. Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable link
16. Decompositions of quadrangle-free planar graphs link
17. List 2-distance $(Delta+2)$-coloring of planar graphs with girth six link
18. Planar graphs decomposable into a forest and a matching link
19. An extension of Kotzigs Theorem link
20. Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 link
21. On the weight of minor faces in triangle-free 3-polytopes link
22. The weight of faces in normal plane maps link
23. An analogue of Franklins Theorem link
24. Weight of edges in normal plane maps link
25. Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices link
26. Weight of 3-paths in sparse plane graphs link
27. Low edges in 3-polytopes link
28. Describing tight descriptions of 3-paths in triangle-free normal plane maps link
29. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k link
30. Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 link
31. Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles link
32. Acyclic 3-choosability of sparse graphs with girth at least 7 link
33. List injective colorings of planar graphs link
34. List strong linear 2-arboricity of sparse graphs link
35. Acyclic 5-choosability of planar graphs without adjacent short cycles link
36. List 2-facial 5-colorability of plane graphs with girth at least 12 link
37. 2-Distance 4-colorability of planar subcubic graphs with girth at least 22 link
38. Acyclic 4-choosability of planar graphs without adjacent short cycles link
39. Acyclic 4-choosability of planar graphs with no 4- and 5-cycles link
40. Describing 3-paths in normal plane maps link
41. Describing 3-faces in normal plane maps with minimum degree 4 link
42. Precise upper bound for the strong edge chromatic number of sparse planar graphs link
43. Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 link
44. Describing faces in plane triangulations link
45. 5-stars of low weight in normal plane maps with minimum degree 5 link
46. Light C_4 and C_5 in 3-polytopes with minimum degree 5 link