Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Karpov, Dmitrii Valerievich
Statistics Math-Net.Ru
Total publications: 26
Scientific articles: 26
Presentations: 4

Number of views:
This page:1813
Abstract pages:5920
Full texts:2438
References:683
Candidate of physico-mathematical sciences
Birth date: 2.03.1975
E-mail: ,
Website: http://eimi.imi.ras.ru/ru/perso/karpov.php

https://www.mathnet.ru/eng/person28014
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/666049

Publications in Math-Net.Ru Citations
2022
1. D. V. Karpov, “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  mathnet
2020
2. D. V. Karpov, “On semi-reconstruction of graphs of connectivity $2$”, Zap. Nauchn. Sem. POMI, 497 (2020),  80–99  mathnet
2019
3. D. V. Karpov, “On plane drawings of $2$-planar graphs”, Zap. Nauchn. Sem. POMI, 488 (2019),  49–65  mathnet 1
4. D. V. Karpov, “On proper edge $3$-colorings of a cubic graph”, Zap. Nauchn. Sem. POMI, 488 (2019),  31–48  mathnet 1
2018
5. D. V. Karpov, “On spanning trees without vertices of degree 2 in plane triangulations”, Zap. Nauchn. Sem. POMI, 475 (2018),  93–98  mathnet
6. D. V. Karpov, “On the structure of a 3-connected graph. 2”, Zap. Nauchn. Sem. POMI, 475 (2018),  41–92  mathnet
2017
7. D. V. Karpov, “Decomposition of a $2$-connected graph into three connected subgraphs”, Zap. Nauchn. Sem. POMI, 464 (2017),  26–47  mathnet; J. Math. Sci. (N. Y.), 236:5 (2019), 490–502 3
2016
8. D. V. Karpov, “Lower bounds on the number of leaves in spanning trees”, Zap. Nauchn. Sem. POMI, 450 (2016),  62–73  mathnet  mathscinet; J. Math. Sci. (N. Y.), 232:1 (2018), 36–43  scopus
9. N. Y. Vlasova, D. V. Karpov, “Bounds on the dynamic chromatic number of a graph in terms of the chromatic number”, Zap. Nauchn. Sem. POMI, 450 (2016),  37–42  mathnet  mathscinet; J. Math. Sci. (N. Y.), 232:1 (2018), 21–24  scopus 2
2014
10. D. V. Karpov, “Deleting vertices from a biconnected graph with preserving biconnectinity”, Zap. Nauchn. Sem. POMI, 427 (2014),  66–73  mathnet  mathscinet; J. Math. Sci. (N. Y.), 212:6 (2016), 683–687  scopus
11. D. V. Karpov, “Minimal $k$-connected graphs with minimal number of vertices of degree $k$”, Zap. Nauchn. Sem. POMI, 427 (2014),  41–65  mathnet  mathscinet; J. Math. Sci. (N. Y.), 212:6 (2016), 666–682  scopus 2
12. D. V. Karpov, “The tree of cuts and minimal $k$-connected graphs”, Zap. Nauchn. Sem. POMI, 427 (2014),  22–40  mathnet  mathscinet; J. Math. Sci. (N. Y.), 212:6 (2016), 654–665  scopus 5
2013
13. D. V. Karpov, “Minimal biconnected graphs”, Zap. Nauchn. Sem. POMI, 417 (2013),  106–127  mathnet; J. Math. Sci. (N. Y.), 204:2 (2015), 244–257  scopus 10
14. D. V. Karpov, “The tree of decomposition of a biconnected graph”, Zap. Nauchn. Sem. POMI, 417 (2013),  86–105  mathnet; J. Math. Sci. (N. Y.), 204:2 (2015), 232–243  scopus 14
2012
15. D. V. Karpov, “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  mathnet  mathscinet; J. Math. Sci. (N. Y.), 196:6 (2014), 768–783  scopus 3
16. D. V. Karpov, “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  mathnet  mathscinet; J. Math. Sci. (N. Y.), 196:6 (2014), 747–767  scopus 2
17. D. V. Karpov, “Upper bound on the number of edges of an almost planar bipartite graph”, Zap. Nauchn. Sem. POMI, 406 (2012),  12–30  mathnet  mathscinet; J. Math. Sci. (N. Y.), 196:6 (2014), 737–746  scopus 7
2011
18. D. V. Karpov, A. V. Pastor, “The structure of decomposition of a triconnected graph”, Zap. Nauchn. Sem. POMI, 391 (2011),  90–148  mathnet; J. Math. Sci. (N. Y.), 184:5 (2012), 601–628  scopus 9
19. N. V. Gravin, D. V. Karpov, “On proper colorings of hypergraphs”, Zap. Nauchn. Sem. POMI, 391 (2011),  79–89  mathnet; J. Math. Sci. (N. Y.), 184:5 (2012), 595–600  scopus 1
20. A. V. Bankevich, D. V. Karpov, “Bounds of a number of leaves of spanning trees”, Zap. Nauchn. Sem. POMI, 391 (2011),  18–34  mathnet; J. Math. Sci. (N. Y.), 184:5 (2012), 564–572  scopus 7
2010
21. D. V. Karpov, “Spanning trees with many leaves”, Zap. Nauchn. Sem. POMI, 381 (2010),  78–87  mathnet; J. Math. Sci. (N. Y.), 179:5 (2011), 616–620  scopus 5
22. D. V. Karpov, “Dynamic proper vertex colorings of the graph”, Zap. Nauchn. Sem. POMI, 381 (2010),  47–77  mathnet; J. Math. Sci. (N. Y.), 179:5 (2011), 601–615  scopus 6
2006
23. D. V. Karpov, “Vertex cuts in a $k$-connected graph”, Zap. Nauchn. Sem. POMI, 340 (2006),  33–60  mathnet  mathscinet  zmath; J. Math. Sci. (N. Y.), 145:3 (2007), 4953–4966  scopus 22
2002
24. D. V. Karpov, “Blocks in $k$-connected graphs”, Zap. Nauchn. Sem. POMI, 293 (2002),  59–93  mathnet  mathscinet  zmath; J. Math. Sci. (N. Y.), 126:3 (2005), 1167–1181 21
2001
25. D. V. Karpov, “A spanning tree with a large number of pendant vertices”, Diskr. Mat., 13:1 (2001),  63–72  mathnet  mathscinet  zmath; Discrete Math. Appl., 11:2 (2002), 163–171 1
2000
26. D. V. Karpov, A. V. Pastor, “On the structure of $k$-connected graphs”, Zap. Nauchn. Sem. POMI, 266 (2000),  76–106  mathnet  mathscinet  zmath; J. Math. Sci. (N. Y.), 113:4 (2003), 584–597 31

Presentations in Math-Net.Ru
1. $K$-планарные графы
D. V. Karpov

November 9, 2022 15:40
2. Структура связности графа
D. V. Karpov
Meetings of the Moscow Mathematical Society
December 13, 2016
3. Структура связности графа
D. V. Karpov
V. A. Rohlin St. Petersburg Topology Seminar
April 20, 2015 17:15
4. Деревья и структура связности графа
D. V. Karpov
MIPT Interdepartmental Seminar on Discrete Mathematics
October 8, 2014 18:30

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024