Embedding graphs with bounded degree in sparse pseudorandom graphs (2004)
Kohayakawa, Yoshiharu 
; Rodl, Vojtech; Sissokho, Papa
Source: Israel Journal of 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 e RODL, Vojtech e SISSOKHO, Papa. Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, v. 139, p. 93-137, 2004Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543. Acesso em: 07 jun. 2024.APA
Kohayakawa, Y., Rodl, V., & Sissokho, P. (2004). Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, 139, 93-137. doi:10.1007/bf02787543NLM
Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 jun. 07 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543Vancouver
Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 jun. 07 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
