Filtros : "Financiado pelo NUMEC/USP" "Estados Unidos" Limpar

Filtros



Refine with date range


  • Source: Journal of Graph Theory. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu e KONSTADINIDIS, Pavlos Bahia e MOTA, Guilherme Oliveira. On an anti-Ramsey threshold for sparse graphs with one triangle. Journal of Graph Theory, v. 87, n. 2, p. 176-187, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22150. Acesso em: 16 nov. 2025.
    • APA

      Kohayakawa, Y., Konstadinidis, P. B., & Mota, G. O. (2018). On an anti-Ramsey threshold for sparse graphs with one triangle. Journal of Graph Theory, 87( 2), 176-187. doi:10.1002/jgt.22150
    • NLM

      Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for sparse graphs with one triangle [Internet]. Journal of Graph Theory. 2018 ; 87( 2): 176-187.[citado 2025 nov. 16 ] Available from: https://doi.org/10.1002/jgt.22150
    • Vancouver

      Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for sparse graphs with one triangle [Internet]. Journal of Graph Theory. 2018 ; 87( 2): 176-187.[citado 2025 nov. 16 ] Available from: https://doi.org/10.1002/jgt.22150
  • Source: Random Structures and Algorithms. Unidade: IME

    Assunto: TEORIA DE RAMSEY

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BÖTTCHER, Julia e KOHAYAKAWA, Yoshiharu e PROCACCI, Aldo. Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, v. 40, n. 4, p. 425-436, 2012Tradução . . Disponível em: https://doi.org/10.1002/rsa.20383. Acesso em: 16 nov. 2025.
    • APA

      Böttcher, J., Kohayakawa, Y., & Procacci, A. (2012). Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, 40( 4), 425-436. doi:10.1002/rsa.20383
    • NLM

      Böttcher J, Kohayakawa Y, Procacci A. Properly coloured copies and rainbow copies of large graphs with small maximum degree [Internet]. Random Structures and Algorithms. 2012 ; 40( 4): 425-436.[citado 2025 nov. 16 ] Available from: https://doi.org/10.1002/rsa.20383
    • Vancouver

      Böttcher J, Kohayakawa Y, Procacci A. Properly coloured copies and rainbow copies of large graphs with small maximum degree [Internet]. Random Structures and Algorithms. 2012 ; 40( 4): 425-436.[citado 2025 nov. 16 ] Available from: https://doi.org/10.1002/rsa.20383

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