ReP USP - Resultado da busca

Trabalho de evento-resumo
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) (2025)
Botler, Fábio Happ ; Fernandes, Cristina Gomes
Source: Proceedings - Booklet of extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. 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 FERNANDES, Cristina Gomes. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 156-162. Disponível em: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf. Acesso em: 09 nov. 2025.
APA
Botler, F. H., & Fernandes, C. G. (2025). Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract). In Proceedings - Booklet of extended abstracts (p. 156-162). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf
NLM
Botler FH, Fernandes CG. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 156-162.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf
Vancouver
Botler FH, Fernandes CG. Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 156-162.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/c8cf92ab-2c7f-415a-8d02-2b4040ca395e/3271547.pdf
Trabalho de evento-resumo
Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract) (2025)
Botler, Fábio Happ ; Couto, Yan Soares; Fernandes, Cristina Gomes ; Figueiredo, E F; Gómez, Renzo ; Santos, V. F; Sato, C M
Source: Proceedings - Booklet of extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. 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 et al. Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 163-167. Disponível em: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf. Acesso em: 09 nov. 2025.
APA
Botler, F. H., Couto, Y. S., Fernandes, C. G., Figueiredo, E. F., Gómez, R., Santos, V. F., & Sato, C. M. (2025). Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract). In Proceedings - Booklet of extended abstracts (p. 163-167). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf
NLM
Botler FH, Couto YS, Fernandes CG, Figueiredo EF, Gómez R, Santos VF, Sato CM. Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 163-167.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf
Vancouver
Botler FH, Couto YS, Fernandes CG, Figueiredo EF, Gómez R, Santos VF, Sato CM. Extremal problems on forest cuts and acyclic neighborhoods in sparse graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 163-167.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/8dd5db3b-2c85-4bf2-99d5-46b14f045ae5/3271548.pdf
Trabalho de evento-resumo
Rainbow path covers of sparse random graphs (extended abstract) (2025)
Botler, Fábio Happ ; Kaique, Antônio; Mendonça, Walner ; Mota, G.O; Sato, C M
Source: Proceedings - Booklet of extended abstracts. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. 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 et al. Rainbow path covers of sparse random graphs (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 168-173. Disponível em: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf. Acesso em: 09 nov. 2025.
APA
Botler, F. H., Kaique, A., Mendonça, W., Mota, G. O., & Sato, C. M. (2025). Rainbow path covers of sparse random graphs (extended abstract). In Proceedings - Booklet of extended abstracts (p. 168-173). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
NLM
Botler FH, Kaique A, Mendonça W, Mota GO, Sato CM. Rainbow path covers of sparse random graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 168-173.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
Vancouver
Botler FH, Kaique A, Mendonça W, Mota GO, Sato CM. Rainbow path covers of sparse random graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 168-173.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf

USP Schools

ReP

Filtros

Authors