Covering 3-edge-colored random graphs with monochromatic trees (2021)
Kohayakawa, Yoshiharu 
; Mendonça, Walner ; Mota, Guilherme Oliveira ; Schülke, Bjarne
Fonte: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Covering 3-edge-colored random graphs with monochromatic trees. SIAM Journal on Discrete Mathematics, v. 35, n. 2, p. 1447-1459, 2021Tradução . . Disponível em: https://doi.org/10.1137/20M137464X. Acesso em: 09 nov. 2025.APA
Kohayakawa, Y., Mendonça, W., Mota, G. O., & Schülke, B. (2021). Covering 3-edge-colored random graphs with monochromatic trees. SIAM Journal on Discrete Mathematics, 35( 2), 1447-1459. doi:10.1137/20M137464XNLM
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-edge-colored random graphs with monochromatic trees [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1447-1459.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1137/20M137464XVancouver
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-edge-colored random graphs with monochromatic trees [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1447-1459.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1137/20M137464X
