Connected Partitions via Connected Dominating Sets

Aikaterini Niklanovits, Kirill Simonov, Shaily Verma +1

The classical theorem due to Győri and Lovász states that any $k$-connected graph $G$ admits a partition into $k$ connected subgraphs, where each subgraph has a prescribed size and…