Almost spanning subgraphs of random graphs after adversarial edge removal (2013)
Bottcher, Julia; Kohayakawa, Yoshiharu 
; Taraz, Anusch
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTTCHER, Julia e KOHAYAKAWA, Yoshiharu e TARAZ, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability & Computing, v. 22, n. 5, p. 639-683, 2013Tradução . . Disponível em: https://doi.org/10.1017/S0963548313000199. Acesso em: 05 jul. 2024.APA
Bottcher, J., Kohayakawa, Y., & Taraz, A. (2013). Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability & Computing, 22( 5), 639-683. doi:10.1017/S0963548313000199NLM
Bottcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Combinatorics, Probability & Computing. 2013 ; 22( 5): 639-683.[citado 2024 jul. 05 ] Available from: https://doi.org/10.1017/S0963548313000199Vancouver
Bottcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Combinatorics, Probability & Computing. 2013 ; 22( 5): 639-683.[citado 2024 jul. 05 ] Available from: https://doi.org/10.1017/S0963548313000199
