Menu

Filtros : "The Electronic Journal of Combinatorics" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • 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

    Source: The Electronic Journal of Combinatorics. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, TEORIA DE RAMSEY

    Versão PublicadaAcesso à fonteHow to cite
    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: 23 maio 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 maio 23 ] 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 maio 23 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70

  • Artigo de periodico

    A continuous analogue of lattice path enumeration (2019)

    Le, Quang-Nhat ; Robins, Sinai ; Vignat, Christophe ; Wakhare, Tanay

    Source: The Electronic Journal of Combinatorics. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 23 maio 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 maio 23 ] 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 maio 23 ] 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

    Source: The Electronic Journal of Combinatorics. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

    Acesso à fonteHow to cite
    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: 23 maio 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 maio 23 ] 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 maio 23 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127
  • 1

1 - 3 (3 records)

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