Menu

Filtros : "2002" "Financiado pela NSF" "IME" Removidos: "ÁLGEBRAS DE LIE" "Israel" "FINEP 1266/130" "Coloquio de Iniciacao Cientifica" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Trabalho de evento

    Efficient testing of hypergraphs (2002)

    Kohayakawa, Yoshiharu ; Nagle, Brendan; Rodl, Vojtech

    Source: Proceedings. Conference titles: Colloquium on Automata, Languages and Programming. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      KOHAYAKAWA, Yoshiharu e NAGLE, Brendan e RODL, Vojtech. Efficient testing of hypergraphs. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87. Acesso em: 11 out. 2024.

    • APA

      Kohayakawa, Y., Nagle, B., & Rodl, V. (2002). Efficient testing of hypergraphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45465-9_87

    • NLM

      Kohayakawa Y, Nagle B, Rodl V. Efficient testing of hypergraphs [Internet]. Proceedings. 2002 ;[citado 2024 out. 11 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87

    • Vancouver

      Kohayakawa Y, Nagle B, Rodl V. Efficient testing of hypergraphs [Internet]. Proceedings. 2002 ;[citado 2024 out. 11 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87

  • Artigo de periodico

    Hypergraphs, quasi-randomness, and conditions for regularity (2002)

    Kohayakawa, Yoshiharu ; Rodl, Vojtech; Skokan, Jozef

    Source: Journal of Combinatorial Theory. Ser. A. 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

      KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SKOKAN, Jozef. Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, v. 97, n. 2, p. 307-352, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2001.3217. Acesso em: 11 out. 2024.

    • APA

      Kohayakawa, Y., Rodl, V., & Skokan, J. (2002). Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, 97( 2), 307-352. doi:10.1006/jcta.2001.3217

    • NLM

      Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 out. 11 ] Available from: https://doi.org/10.1006/jcta.2001.3217

    • Vancouver

      Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 out. 11 ] Available from: https://doi.org/10.1006/jcta.2001.3217
  • 1

1 - 2 (2 records)

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