The k-hop connected dominating set problem: hardness and polyhedra. - Rafael S. Coelho; Phablo F. S. Moura; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. - Fábio Botler; Maycon Sambinelli; Rafael S. Coelho; Orlando Lee (CoRR, 2017)

The k-hop connected dominating set problem: approximation and hardness. - Rafael S. Coelho; Phablo F. S. Moura; Yoshiko Wakabayashi (J. Comb. Optim., 2017)

Gallai's path decomposition conjecture for graphs with treewidth at most 3. - Fábio Botler; Maycon Sambinelli; Rafael S. Coelho; Orlando Lee (J. Graph Theory, 2020)