Rainbow path covers of sparse random graphs (extended abstract) (2025)
- Authors:
- Autor USP: BOTLER, FÁBIO HAPP - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: HUN-REN Alfréd Rényi Institute of Mathematics
- Publisher place: Budapeste
- Date published: 2025
- Source:
- Título: Proceedings - Booklet of extended abstracts
- Volume/Número/Paginação/Ano: p. 168-173, 2025
- Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB
-
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: 27 dez. 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 dez. 27 ] 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 dez. 27 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf - On nonrepetitive colorings of paths and cycles
- Decomposição de grafos em caminhos
- Ramsey goodness of paths versus unbalanced graphs
- Separating cycle systems
- Biclique immersions in graphs with independence number 2
- Separating the edges of a graph by cycles and by subdivisions of K4
- Independent dominating sets in planar triangulations
- Immersions of large cliques in graphs with independence number 2 and bounded maximum degree (extended abstract)
- On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
- Counting graph orientations with no directed triangles
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3271549.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
