Decompositions of triangle-free 5-regular graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; Yoshiko Wakabayashi (Discret. Math., 2015)

On path decompositions of 2k-regular graphs. - Fábio Botler; Andrea Jiménez (Electron. Notes Discret. Math., 2015)

Path decompositions of regular graphs with prescribed girth. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Decompositions of highly connected graphs into paths of any given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Decompositions of highly connected graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. - Fábio Botler; Maycon Sambinelli; Rafael S. Coelho; Orlando Lee (CoRR, 2017)

Decomposing 8-regular graphs into paths of length 4. - Fábio Botler; Alexandre Talon (Discret. Math., 2017)

Decomposing regular graphs with prescribed girth into paths of given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Eur. J. Comb., 2017)

Gallai's conjecture for graphs with treewidth 3. - Fábio Botler; Maycon Sambinelli (Electron. Notes Discret. Math., 2017)

Decomposition of 8-regular graphs into paths of length 4. - Fábio Botler; Alexandre Talon (Electron. Notes Discret. Math., 2017)

Decomposing highly edge-connected graphs into paths of any given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (J. Comb. Theory B, 2017)

SUPERSET: A (Super)Natural Variant of the Card Game SET. - Fábio Botler; Andrés Cristi; Ruben Hoeksma; Kevin Schewior; Andreas Tönnis (FUN, 2018)

Decomposing highly connected graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Discret. Appl. Math., 2018)

Gallai's path decomposition conjecture for triangle-free planar graphs. - Fábio Botler; Andrea Jiménez; Maycon Sambinelli (Discret. Math., 2019)

On Computing the Path Number of a Graph. - Fábio Botler; R. Cano; Maycon Sambinelli (LAGOS, 2019)

On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. - Fábio Botler; Cristina G. Fernandes; Juan Gutiérrez 001 (LAGOS, 2019)

Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1. - Fábio Botler; Luiz Hoffmann (CoRR, 2020)

Gallai's path decomposition conjecture for graphs with treewidth at most 3. - Fábio Botler; Maycon Sambinelli; Rafael S. Coelho; Orlando Lee (J. Graph Theory, 2020)

The 2-Decomposition Conjecture for a new class of graphs. - Fábio Botler; Andrea Jiménez; Maycon Sambinelli; Yoshiko Wakabayashi (LAGOS, 2021)

Towards Gallai's path decomposition conjecture. - Fábio Botler; Maycon Sambinelli (J. Graph Theory, 2021)

Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1. - Fábio Botler; Luiz Hoffmann (Discret. Math., 2022)

Counting orientations of graphs with no strongly connected tournaments. - Fábio Botler; Carlos Hoppen; Guilherme Oliveira Mota (Discret. Math., 2022)

On nonrepetitive colorings of cycles. - Fábio Botler; Wanderson Lomenha; João Pedro de Souza (LAGOS, 2023)

Separating the edges of a graph by a linear number of paths. - Marthe Bonamy; Fábio Botler; François Dross; Tássio Naia; Jozef Skokan (CoRR, 2023)

The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. - Fábio Botler; Lucas Colucci; Yoshiharu Kohayakawa (J. Graph Theory, 2023)

The mod k $k$ chromatic index of random graphs. - Fábio Botler; Lucas Colucci; Yoshiharu Kohayakawa (J. Graph Theory, 2023)

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. - Fábio Botler; Phablo F. S. Moura; Tássio Naia (Discret. Math., 2023)

Independent Dominating Sets in Planar Triangulations. - Fábio Botler; Cristina G. Fernandes; Juan Gutiérrez 001 (Electron. J. Comb., 2024)

Separating the edges of a graph by cycles and by subdivisions of K4. - Fábio Botler; Tássio Naia (CoRR, 2024)

Ramsey Goodness of paths and unbalanced graphs. - Fábio Botler; Luiz Moreira; João Pedro de Souza (CoRR, 2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs. - Fábio Botler; Y. S. Couto; Cristina G. Fernandes; E. F. de Figueiredo; Renzo Gómez; V. F. dos Santos; C. M. Sato (CoRR, 2024)

Biclique immersions in graphs with independence number 2. - Fábio Botler; Andrea Jiménez; Carla Negri Lintzmayer; Adrián Pastine; Daniel Quiroz 001; Maycon Sambinelli (Eur. J. Comb., 2024)

On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture. - Fábio Botler; Andrea Jiménez; Maycon Sambinelli; Yoshiko Wakabayashi (Graphs Comb., 2024)

Counting Graph Orientations with No Directed Triangles. - Pedro Araújo; Fábio Botler; Guilherme Oliveira Mota (Electron. J. Comb., 2025)

On nonrepetitive colorings of paths and cycles. - Fábio Botler; Wanderson Lomenha; João Pedro de Souza (Discret. Appl. Math., 2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree. - Fábio Botler; Cristina G. Fernandes; Carla Negri Lintzmayer; Rui A. Lopes; Suchismita Mishra 001; Bruno L. Netto; Maycon Sambinelli (CoRR, 2025)

On Modular Edge Colourings of Graphs. - Gaétan Berthe; Marthe Bonamy; Fábio Botler; Gaia Carenini; Lucas Colucci; Arthur Dumas; Fatemeh Ghasemi; Pedro Mariano Viana Neto (CoRR, 2025)