Decompositions of highly connected graphs into paths of length five (2015)
Botler, Fábio Happ 
; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.036. Acesso em: 24 abr. 2024. , 2015APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.036NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
