ReP USP - Resultado da busca

Artigo de periodico
Separating the edges of a graph by cycles and by subdivisions of K4 (2025)
Botler, Fábio Happ ; Naia, Tássio
Source: Journal of Graph Theory. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e NAIA, Tássio. Separating the edges of a graph by cycles and by subdivisions of K4. Journal of Graph Theory, v. 110, n. 1, p. 41-47, 2025Tradução . . Disponível em: https://doi.org/10.1002/jgt.23248. Acesso em: 07 nov. 2025.
APA
Botler, F. H., & Naia, T. (2025). Separating the edges of a graph by cycles and by subdivisions of K4. Journal of Graph Theory, 110( 1), 41-47. doi:10.1002/jgt.23248
NLM
Botler FH, Naia T. Separating the edges of a graph by cycles and by subdivisions of K4 [Internet]. Journal of Graph Theory. 2025 ; 110( 1): 41-47.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.23248
Vancouver
Botler FH, Naia T. Separating the edges of a graph by cycles and by subdivisions of K4 [Internet]. Journal of Graph Theory. 2025 ; 110( 1): 41-47.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.23248
Artigo de periodico
The mod k chromatic index of graphs is O(k) (2023)
Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
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 graphs is O(k). Journal of Graph Theory, v. 102, n. 1, p. 197-200, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22866. Acesso em: 07 nov. 2025.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of graphs is O(k). Journal of Graph Theory, 102( 1), 197-200. doi:10.1002/jgt.22866
NLM
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22866
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22866
Artigo de periodico
The mod k chromatic index of random graphs (2023)
Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
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. Journal of Graph Theory, v. 103, n. 4, p. 767-779, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22946. Acesso em: 07 nov. 2025.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of random graphs. Journal of Graph Theory, 103( 4), 767-779. doi:10.1002/jgt.22946
NLM
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22946
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22946
Artigo de periodico
Finding any given 2-factor in sparse pseudorandom graphs efficiently (2021)
Han, Jie ; Kohayakawa, Yoshiharu ; Morris, Patrick; Person, Yury
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, v. 96, n. 1, p. 87-108, 2021Tradução . . Disponível em: https://doi.org/10.1002/jgt.22576. Acesso em: 07 nov. 2025.
APA
Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2021). Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96( 1), 87-108. doi:10.1002/jgt.22576
NLM
Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22576
Vancouver
Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22576
Artigo de periodico
The size-Ramsey number of powers of paths (2019)
Clemens, Dennis; Jenssen, Matthew; Kohayakawa, Yoshiharu ; Morrison, Natasha; Mota, Guilherme Oliveira ; Reding, Damian; Roberts, Barnaby
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CLEMENS, Dennis et al. The size-Ramsey number of powers of paths. Journal of Graph Theory, v. 91, n. 3, p. 290-299, 2019Tradução . . Disponível em: https://doi.org/10.1002/jgt.22432. Acesso em: 07 nov. 2025.
APA
Clemens, D., Jenssen, M., Kohayakawa, Y., Morrison, N., Mota, G. O., Reding, D., & Roberts, B. (2019). The size-Ramsey number of powers of paths. Journal of Graph Theory, 91( 3), 290-299. doi:10.1002/jgt.22432
NLM
Clemens D, Jenssen M, Kohayakawa Y, Morrison N, Mota GO, Reding D, Roberts B. The size-Ramsey number of powers of paths [Internet]. Journal of Graph Theory. 2019 ; 91( 3): 290-299.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22432
Vancouver
Clemens D, Jenssen M, Kohayakawa Y, Morrison N, Mota GO, Reding D, Roberts B. The size-Ramsey number of powers of paths [Internet]. Journal of Graph Theory. 2019 ; 91( 3): 290-299.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22432
Artigo de periodico
On minimum bisection and related cut problems in trees and tree-like graphs (2018)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Source: Journal of Graph Theory. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, v. 89, n. 2, p. 214-245, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22248. Acesso em: 07 nov. 2025.
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2018). On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, 89( 2), 214-245. doi:10.1002/jgt.22248
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22248
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.22248
Artigo de periodico
On an anti-Ramsey threshold for sparse graphs with one triangle (2018)
Kohayakawa, Yoshiharu ; Konstadinidis, Pavlos Bahia; Mota, Guilherme Oliveira
Source: Journal of Graph Theory. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
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: 07 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. 07 ] 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. 07 ] Available from: https://doi.org/10.1002/jgt.22150
Artigo de periodico
Note on a min-max conjecture of Woodall (2001)
Lee, Orlando; Wakabayashi, Yoshiko
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEE, Orlando e WAKABAYASHI, Yoshiko. Note on a min-max conjecture of Woodall. Journal of Graph Theory, v. 38, n. 1, p. 36-41, 2001Tradução . . Disponível em: https://doi.org/10.1002/jgt.1022. Acesso em: 07 nov. 2025.
APA
Lee, O., & Wakabayashi, Y. (2001). Note on a min-max conjecture of Woodall. Journal of Graph Theory, 38( 1), 36-41. doi:10.1002/jgt.1022
NLM
Lee O, Wakabayashi Y. Note on a min-max conjecture of Woodall [Internet]. Journal of Graph Theory. 2001 ; 38( 1): 36-41.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.1022
Vancouver
Lee O, Wakabayashi Y. Note on a min-max conjecture of Woodall [Internet]. Journal of Graph Theory. 2001 ; 38( 1): 36-41.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.1022
Artigo de periodico
Ramsey-type results for oriented trees (1996)
Kohayakawa, Yoshiharu ; Luczak, Tomasz; Rodl, Vojtech
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz e RODL, Vojtech. Ramsey-type results for oriented trees. Journal of Graph Theory, v. 22, n. 1, p. 1-8, 1996Tradução . . Disponível em: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s. Acesso em: 07 nov. 2025.
APA
Kohayakawa, Y., Luczak, T., & Rodl, V. (1996). Ramsey-type results for oriented trees. Journal of Graph Theory, 22( 1), 1-8. doi:10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s
NLM
Kohayakawa Y, Luczak T, Rodl V. Ramsey-type results for oriented trees [Internet]. Journal of Graph Theory. 1996 ; 22( 1): 1-8.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s
Vancouver
Kohayakawa Y, Luczak T, Rodl V. Ramsey-type results for oriented trees [Internet]. Journal of Graph Theory. 1996 ; 22( 1): 1-8.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s
Artigo de periodico
Maximum diameter of regular digraphs (1992)
Soares, J A R
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOARES, J A R. Maximum diameter of regular digraphs. Journal of Graph Theory, v. no 1992, n. 5 , p. 437-50, 1992Tradução . . Disponível em: https://doi.org/10.1002/jgt.3190160505. Acesso em: 07 nov. 2025.
APA
Soares, J. A. R. (1992). Maximum diameter of regular digraphs. Journal of Graph Theory, no 1992( 5 ), 437-50. doi:10.1002/jgt.3190160505
NLM
Soares JAR. Maximum diameter of regular digraphs [Internet]. Journal of Graph Theory. 1992 ; no 1992( 5 ): 437-50.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.3190160505
Vancouver
Soares JAR. Maximum diameter of regular digraphs [Internet]. Journal of Graph Theory. 1992 ; no 1992( 5 ): 437-50.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.3190160505
Artigo de periodico
Hypotraceable digraphs (1980)
Grötschel, Martin ; Thomassen, Carsten ; Wakabayashi, Yoshiko
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GRÖTSCHEL, Martin e THOMASSEN, Carsten e WAKABAYASHI, Yoshiko. Hypotraceable digraphs. Journal of Graph Theory, v. 4, n. 4, p. 377-381, 1980Tradução . . Disponível em: https://doi.org/10.1002/jgt.3190040406. Acesso em: 07 nov. 2025.
APA
Grötschel, M., Thomassen, C., & Wakabayashi, Y. (1980). Hypotraceable digraphs. Journal of Graph Theory, 4( 4), 377-381. doi:10.1002/jgt.3190040406
NLM
Grötschel M, Thomassen C, Wakabayashi Y. Hypotraceable digraphs [Internet]. Journal of Graph Theory. 1980 ; 4( 4): 377-381.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.3190040406
Vancouver
Grötschel M, Thomassen C, Wakabayashi Y. Hypotraceable digraphs [Internet]. Journal of Graph Theory. 1980 ; 4( 4): 377-381.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1002/jgt.3190040406

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration