Separating the edges of a graph by cycles and by subdivisions of K4 (2025)
Botler, Fábio Happ 
; Naia, Tássio
Source: Journal of Graph Theory. Unidade: IME
Subjects: 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 e NAIA, Tássio. Separating the edges of a graph by cycles and by subdivisions of K4. Journal of Graph Theory, v. 110, n. 1, p. 41-47, 2025Tradução . . Disponível em: https://doi.org/10.1002/jgt.23248. Acesso em: 10 nov. 2025.APA
Botler, F. H., & Naia, T. (2025). Separating the edges of a graph by cycles and by subdivisions of K4. Journal of Graph Theory, 110( 1), 41-47. doi:10.1002/jgt.23248NLM
Botler FH, Naia T. Separating the edges of a graph by cycles and by subdivisions of K4 [Internet]. Journal of Graph Theory. 2025 ; 110( 1): 41-47.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1002/jgt.23248Vancouver
Botler FH, Naia T. Separating the edges of a graph by cycles and by subdivisions of K4 [Internet]. Journal of Graph Theory. 2025 ; 110( 1): 41-47.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1002/jgt.23248
