Decomposing highly connected graphs into paths of length five (2018)
Botler, Fábio Happ 
; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Conference titles: Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2016.08.001. Acesso em: 09 fev. 2026. , 2018APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2018). Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2016.08.001NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1016/j.dam.2016.08.001Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1016/j.dam.2016.08.001
