Decomposing highly edge-connected graphs into paths of any given length (2017)
Fonte: Journal of Combinatorial Theory, Series B. Unidade: IME
Assuntos: COMBINATÓRIA, TEORIA DOS GRAFOS
ABNT
BOTLER, Fábio Happ et al. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2016.07.010. Acesso em: 18 ago. 2024.APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122, 508-542. doi:10.1016/j.jctb.2016.07.010NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010