ReP USP - Resultado da busca

Artigo de periodico
On the anti-Ramsey threshold for non-balanced graphs (2024)
Araújo, Pedro; Martins, Taísa ; Mattos, Letícia; Mendonça, Walner ; Moreira, Luiz; Mota, Guilherme Oliveira
Fonte: The Electronic Journal of Combinatorics. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Pedro et al. On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, v. 31, n. 1, p. 1-21, 2024Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70. Acesso em: 20 jun. 2024.
APA
Araújo, P., Martins, T., Mattos, L., Mendonça, W., Moreira, L., & Mota, G. O. (2024). On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, 31( 1), 1-21. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
NLM
Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2024 jun. 20 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
Vancouver
Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2024 jun. 20 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
Artigo de periodico
Independent dominating sets in planar triangulations (2024)
Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan
Fonte: The Electronic Journal of Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, v. 31, n. 2, p. 1-10, 2024Tradução . . Disponível em: https://doi.org/10.37236/12548. Acesso em: 20 jun. 2024.
APA
Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2024). Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, 31( 2), 1-10. doi:10.37236/12548
NLM
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 jun. 20 ] Available from: https://doi.org/10.37236/12548
Vancouver
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 jun. 20 ] Available from: https://doi.org/10.37236/12548
Artigo de periodico
A continuous analogue of lattice path enumeration (2019)
Le, Quang-Nhat ; Robins, Sinai ; Vignat, Christophe ; Wakhare, Tanay
Fonte: The Electronic Journal of Combinatorics. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LE, Quang-Nhat et al. A continuous analogue of lattice path enumeration. The Electronic Journal of Combinatorics, v. 26, n. 3, p. 1-13, 2019Tradução . . Disponível em: https://doi.org/10.37236/8788. Acesso em: 20 jun. 2024.
APA
Le, Q. -N., Robins, S., Vignat, C., & Wakhare, T. (2019). A continuous analogue of lattice path enumeration. The Electronic Journal of Combinatorics, 26( 3), 1-13. doi:10.37236/8788
NLM
Le Q-N, Robins S, Vignat C, Wakhare T. A continuous analogue of lattice path enumeration [Internet]. The Electronic Journal of Combinatorics. 2019 ; 26( 3): 1-13.[citado 2024 jun. 20 ] Available from: https://doi.org/10.37236/8788
Vancouver
Le Q-N, Robins S, Vignat C, Wakhare T. A continuous analogue of lattice path enumeration [Internet]. The Electronic Journal of Combinatorics. 2019 ; 26( 3): 1-13.[citado 2024 jun. 20 ] Available from: https://doi.org/10.37236/8788
Artigo de periodico
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications (2008)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu
Fonte: The Electronic Journal of Combinatorics. Unidade: IME
Assuntos: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos e KOHAYAKAWA, Yoshiharu. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications. The Electronic Journal of Combinatorics, v. 15, p. 1-15, 2008Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127. Acesso em: 20 jun. 2024.
APA
Dellamonica Junior, D., & Kohayakawa, Y. (2008). An algorithmic Friedman-Pippenger theorem on tree embeddings and applications. The Electronic Journal of Combinatorics, 15, 1-15. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127
NLM
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications [Internet]. The Electronic Journal of Combinatorics. 2008 ; 15 1-15.[citado 2024 jun. 20 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127
Vancouver
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications [Internet]. The Electronic Journal of Combinatorics. 2008 ; 15 1-15.[citado 2024 jun. 20 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127

Unidades USP

ReP

Filtros

Autores

Autores USP

Agência de fomento

Afiliação dos autores externos não normalizada