Partitioning a graph into highly connected subgraphs

Valentin Borozan, Michael Ferrara, Shinya Fujita +4

Given $k\ge 1$, a $k$-proper partition of a graph $G$ is a partition $\mathcal{P}$ of $V(G)$ such that each part $P$ of $\mathcal{P}$ induces a $k$-connected subgraph of $G$. We…