Karpov Dmitrii Valerievich

Publications in Math-Net.Ru

1. On the reconstruction of graphs of connectivity $2$ having a $2$-vertex set dividing this graph into at least $3$ parts
   
   Zap. Nauchn. Sem. POMI, 518 (2022),  124–151
2. On semi-reconstruction of graphs of connectivity $2$
   
   Zap. Nauchn. Sem. POMI, 497 (2020),  80–99
3. On plane drawings of $2$-planar graphs
   
   Zap. Nauchn. Sem. POMI, 488 (2019),  49–65
4. On proper edge $3$-colorings of a cubic graph
   
   Zap. Nauchn. Sem. POMI, 488 (2019),  31–48
5. On spanning trees without vertices of degree 2 in plane triangulations
   
   Zap. Nauchn. Sem. POMI, 475 (2018),  93–98
6. On the structure of a 3-connected graph. 2
   
   Zap. Nauchn. Sem. POMI, 475 (2018),  41–92
7. Decomposition of a $2$-connected graph into three connected subgraphs
   
   Zap. Nauchn. Sem. POMI, 464 (2017),  26–47
8. Lower bounds on the number of leaves in spanning trees
   
   Zap. Nauchn. Sem. POMI, 450 (2016),  62–73
9. Bounds on the dynamic chromatic number of a graph in terms of the chromatic number
   
   Zap. Nauchn. Sem. POMI, 450 (2016),  37–42
10. Deleting vertices from a biconnected graph with preserving biconnectinity
    
    Zap. Nauchn. Sem. POMI, 427 (2014),  66–73
11. Minimal $k$-connected graphs with minimal number of vertices of degree $k$
    
    Zap. Nauchn. Sem. POMI, 427 (2014),  41–65
12. The tree of cuts and minimal $k$-connected graphs
    
    Zap. Nauchn. Sem. POMI, 427 (2014),  22–40
13. Minimal biconnected graphs
    
    Zap. Nauchn. Sem. POMI, 417 (2013),  106–127
14. The tree of decomposition of a biconnected graph
    
    Zap. Nauchn. Sem. POMI, 417 (2013),  86–105
15. Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least 4
    
    Zap. Nauchn. Sem. POMI, 406 (2012),  67–94
16. Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree 3 and at least 4
    
    Zap. Nauchn. Sem. POMI, 406 (2012),  31–66
17. Upper bound on the number of edges of an almost planar bipartite graph
    
    Zap. Nauchn. Sem. POMI, 406 (2012),  12–30
18. The structure of decomposition of a triconnected graph
    
    Zap. Nauchn. Sem. POMI, 391 (2011),  90–148
19. On proper colorings of hypergraphs
    
    Zap. Nauchn. Sem. POMI, 391 (2011),  79–89
20. Bounds of a number of leaves of spanning trees
    
    Zap. Nauchn. Sem. POMI, 391 (2011),  18–34
21. Spanning trees with many leaves
    
    Zap. Nauchn. Sem. POMI, 381 (2010),  78–87
22. Dynamic proper vertex colorings of the graph
    
    Zap. Nauchn. Sem. POMI, 381 (2010),  47–77
23. Vertex cuts in a $k$-connected graph
    
    Zap. Nauchn. Sem. POMI, 340 (2006),  33–60
24. Blocks in $k$-connected graphs
    
    Zap. Nauchn. Sem. POMI, 293 (2002),  59–93
25. A spanning tree with a large number of pendant vertices
    
    Diskr. Mat., 13:1 (2001),  63–72
26. On the structure of $k$-connected graphs
    
    Zap. Nauchn. Sem. POMI, 266 (2000),  76–106