Menu

Filtros : "Financiado pelo NUMEC/USP" "Brasil" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    On Tuza’s conjecture for triangulations and graphs with small treewidth (2021)

    Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan

    Source: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    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. On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, v. 344, n. 4, p. 1-12, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2020.112281. Acesso em: 16 nov. 2025.

    • APA

      Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2021). On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, 344( 4), 1-12. doi:10.1016/j.disc.2020.112281

    • NLM

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.[citado 2025 nov. 16 ] Available from: https://doi.org/10.1016/j.disc.2020.112281

    • Vancouver

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.[citado 2025 nov. 16 ] Available from: https://doi.org/10.1016/j.disc.2020.112281

  • Artigo de periodico

    Properly coloured copies and rainbow copies of large graphs with small maximum degree (2012)

    Böttcher, Julia; Kohayakawa, Yoshiharu ; Procacci, Aldo

    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
  • 1

1 - 2 (2 records)

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