Menu

Filtros : "European Conference on Combinatorics, Graph Theory and Applications - EuroComb" "Brasil" Limpar

Filtros

Refine with date range

  • 1

1 - 5 (5 records)

  • Trabalho de evento-resumo

    The mod k chromatic index of random graphs (2021)

    Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu

    Source: Extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

    Acesso à 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 COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of random graphs. 2021, Anais.. Cham: Birkhäuser, 2021. Disponível em: https://doi.org/10.1007/978-3-030-83823-2_116. Acesso em: 10 nov. 2025.

    • APA

      Botler, F. H., Colucci, L., & Kohayakawa, Y. (2021). The mod k chromatic index of random graphs. In Extended abstracts. Cham: Birkhäuser. doi:10.1007/978-3-030-83823-2_116

    • NLM

      Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Extended abstracts. 2021 ;[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/978-3-030-83823-2_116

    • Vancouver

      Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Extended abstracts. 2021 ;[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/978-3-030-83823-2_116

  • Trabalho de evento-resumo

    Counting Ck -free orientations of G(n, p) (2021)

    Campos, Marcelo; Collares, Maurício; Mota, Guilherme Oliveira

    Source: Extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

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

    • ABNT

      CAMPOS, Marcelo e COLLARES, Maurício e MOTA, Guilherme Oliveira. Counting Ck -free orientations of G(n, p). 2021, Anais.. Cham: Birkhäuser, 2021. Disponível em: https://doi.org/10.1007/978-3-030-83823-2_125. Acesso em: 10 nov. 2025.

    • APA

      Campos, M., Collares, M., & Mota, G. O. (2021). Counting Ck -free orientations of G(n, p). In Extended abstracts. Cham: Birkhäuser. doi:10.1007/978-3-030-83823-2_125

    • NLM

      Campos M, Collares M, Mota GO. Counting Ck -free orientations of G(n, p) [Internet]. Extended abstracts. 2021 ;[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/978-3-030-83823-2_125

    • Vancouver

      Campos M, Collares M, Mota GO. Counting Ck -free orientations of G(n, p) [Internet]. Extended abstracts. 2021 ;[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/978-3-030-83823-2_125

  • Trabalho de evento-anais periodico

    Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (2014)

    Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lefmann, Hanno

    Source: European Journal of Combinatorics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      HOPPEN, Carlos e KOHAYAKAWA, Yoshiharu e LEFMANN, Hanno. Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. European Journal of Combinatorics. London: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.ejc.2013.06.027. Acesso em: 10 nov. 2025. , 2014

    • APA

      Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2014). Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. European Journal of Combinatorics. London: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.ejc.2013.06.027

    • NLM

      Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number [Internet]. European Journal of Combinatorics. 2014 ; 35 354-373.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1016/j.ejc.2013.06.027

    • Vancouver

      Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number [Internet]. European Journal of Combinatorics. 2014 ; 35 354-373.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1016/j.ejc.2013.06.027

  • Trabalho de evento-anais periodico

    Every hereditary permutation property is testable (2011)

    Bastos, Antonio Josefran de Oliveira; Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Sampaio, Rudini Menezes

    Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Subjects: COMBINATÓRIA, PERMUTAÇÕES

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

    • ABNT

      BASTOS, Antonio Josefran de Oliveira et al. Every hereditary permutation property is testable. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2011.09.021. Acesso em: 10 nov. 2025. , 2011

    • APA

      Bastos, A. J. de O., Hoppen, C., Kohayakawa, Y., & Sampaio, R. M. (2011). Every hereditary permutation property is testable. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.09.021

    • NLM

      Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021

    • Vancouver

      Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021

  • Trabalho de evento-anais periodico

    Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (2011)

    Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lefmann, Hanno

    Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

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

    • ABNT

      HOPPEN, Carlos e KOHAYAKAWA, Yoshiharu e LEFMANN, Hanno. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2011.09.076. Acesso em: 10 nov. 2025. , 2011

    • APA

      Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2011). Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.09.076

    • NLM

      Hoppen C, Kohayakawa Y, Lefmann H. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 469-474.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1016/j.endm.2011.09.076

    • Vancouver

      Hoppen C, Kohayakawa Y, Lefmann H. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 469-474.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1016/j.endm.2011.09.076
  • 1

1 - 5 (5 records)

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