Disjoint covering of bipartite graphs with $s$-clubs

Angelo Monti, Blerina Sinaimeri

For a positive integer $s$, an $s$-club in a graph $G$ is a set of vertices inducing a subgraph with diameter at most $s$. As generalizations of cliques, $s$-clubs offer a flexible…