2015 — D.Sc. in Mathematics and Physics («Discrete Mathematics and Mathematical Cybernetics»)

**Institution:** St. Petersburg Department of Steklov Mathematical Institute

**Thesis title:** The Structure of Connectivity of a Graph

2004 — Ph.D. (C.Sc.) in Mathematics and Physics («Discrete Mathematics and Mathematical Cybernetics»)

**Institution:** St. Petersburg State University

**Thesis title:** The Structure of Decomposition of a k-Connected Graph

**Advisor:** Y.V. Matiyasevich

1997 — Specialist Degree in Mathematics

**Institution:** St. Petersburg State University

Graph theory: connectivity, colorings, planarity and others.

- D.V. Karpov. The decomposition tree of a biconnected graph. Journal of Mathematical Sciences 204:2, 232–243, 2015.
- D.V. Karpov. Minimal k-connected graphs with minimal number of vertices of degree k. Journal of Mathematical Sciences 212:6, 666–682, 2016. [arXiv]
- D.V. Karpov. Minimal k-connected graphs with small number of vertices of degree k. Fundamenta Informaticae 145:3, 279–312, 2016.
- D.V. Karpov. An analog of Brooks' theorem for dynamic colorings. Moscow Journal of Combinatorics and Number theory 6:1, 25–63, 2016.
- D.V. Karpov. Large contractible subgraphs of a 3-connected graph. Discussiones Mathematicae Graph Theory, in press.

Course name

Year

Semester

Role