An extremal problem for Random graphs and the number of graphs with large even-girth (1998)
Fonte: Combinatorica. Unidade: IME
Assunto: TEORIA DOS GRAFOS
ABNT
KOHAYAKAWA, Yoshiharu e KREUTER, Bernd e STEGER, Angelika. An extremal problem for Random graphs and the number of graphs with large even-girth. Combinatorica, v. 18, n. 1, p. 101-120, 1998Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/PL00009804. Acesso em: 14 nov. 2024.APA
Kohayakawa, Y., Kreuter, B., & Steger, A. (1998). An extremal problem for Random graphs and the number of graphs with large even-girth. Combinatorica, 18( 1), 101-120. doi:10.1007%2FPL00009804NLM
Kohayakawa Y, Kreuter B, Steger A. An extremal problem for Random graphs and the number of graphs with large even-girth [Internet]. Combinatorica. 1998 ; 18( 1): 101-120.[citado 2024 nov. 14 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/PL00009804Vancouver
Kohayakawa Y, Kreuter B, Steger A. An extremal problem for Random graphs and the number of graphs with large even-girth [Internet]. Combinatorica. 1998 ; 18( 1): 101-120.[citado 2024 nov. 14 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/PL00009804