ReP USP - Resultado da busca

Filtros : "Financiamento NUMEC/USP" "Financiamento CAPES" Limpar

Filtros

Artigo de periodico
Decomposing highly edge-connected graphs into paths of any given length (2017)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2016.07.010. Acesso em: 09 nov. 2025.
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122, 508-542. doi:10.1016/j.jctb.2016.07.010
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Trabalho de evento
An improved upper bound on the density of universal random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 09 nov. 2025.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20

Digital Library of Intellectual Production of Universidade de São Paulo 2012 - 2025