Menu

Filtros : "Financiamento FAPESP" "Financiamento FAPERGS" "IME-MAC" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    Counting orientations of graphs with no strongly connected tournaments (2022)

    Botler, Fábio Happ ; Hoppen, Carlos ; Mota, Guilherme Oliveira

    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 HOPPEN, Carlos e MOTA, Guilherme Oliveira. Counting orientations of graphs with no strongly connected tournaments. Discrete Mathematics, v. 345, n. 12, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2022.113024. Acesso em: 08 out. 2025.

    • APA

      Botler, F. H., Hoppen, C., & Mota, G. O. (2022). Counting orientations of graphs with no strongly connected tournaments. Discrete Mathematics, 345( 12). doi:10.1016/j.disc.2022.113024

    • NLM

      Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Discrete Mathematics. 2022 ; 345( 12):[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.disc.2022.113024

    • Vancouver

      Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Discrete Mathematics. 2022 ; 345( 12):[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.disc.2022.113024

  • Trabalho de evento-anais periodico

    Counting orientations of graphs with no strongly connected tournaments (2021)

    Botler, Fábio Happ ; Hoppen, Carlos ; Mota, Guilherme Oliveira

    Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à 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 HOPPEN, Carlos e MOTA, Guilherme Oliveira. Counting orientations of graphs with no strongly connected tournaments. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2021.11.047. Acesso em: 08 out. 2025. , 2021

    • APA

      Botler, F. H., Hoppen, C., & Mota, G. O. (2021). Counting orientations of graphs with no strongly connected tournaments. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.047

    • NLM

      Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Procedia Computer Science. 2021 ; 195 385-393.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.procs.2021.11.047

    • Vancouver

      Botler FH, Hoppen C, Mota GO. Counting orientations of graphs with no strongly connected tournaments [Internet]. Procedia Computer Science. 2021 ; 195 385-393.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.procs.2021.11.047
  • 1

1 - 2 (2 records)

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