Follow
Rafael Santos Coelho
Title
Cited by
Cited by
Year
The k-hop connected dominating set problem: approximation and hardness
RS Coelho, PFS Moura, Y Wakabayashi
Journal of Combinatorial Optimization 34 (4), 24, 2017
102017
On Gallai's and Hajós' conjectures for graphs with treewidth at most 3
F Botler, M Sambinelli, RS Coelho, O Lee
arXiv preprint arXiv:1706.04334, 2017
92017
The k-hop connected dominating set problem: hardness and polyhedra
RS Coelho, PFS Moura, Y Wakabayashi
Electronic Notes in Discrete Mathematics 50, 59-64, 2015
92015
Gallai's path decomposition conjecture for graphs with treewidth at most 3
F Botler, M Sambinelli, RS Coelho, O Lee
Journal of Graph Theory 93 (3), 328-349, 2020
42020
On a joint technique for Hajos’ and Gallai’s conjectures
F Botler, M Sambinelli, RS Coelho, O Lee
2º ETC (Encontro de Teoria da Computação)/XXXVII Congresso da Sociedade …, 2017
22017
The system can't perform the operation now. Try again later.
Articles 1–5