Fábio Botler

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 36

Top Topics

Highly Connected

Connected Graphs

Graph Theoretic

Top Venues

Electron. Notes Discret. Math.

Publications

Fábio Botler, Tássio Naia
. CoRR (2024)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
Independent Dominating Sets in Planar Triangulations. Electron. J. Comb. 31 (2) (2024)
Fábio Botler, Andrea Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel Quiroz, Maycon Sambinelli
Biclique immersions in graphs with independence number 2. Eur. J. Comb. 122 (2024)
Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. J. Graph Theory 102 (1) (2023)
Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan
Separating the edges of a graph by a linear number of paths. CoRR (2023)
Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa
The mod k $k$ chromatic index of random graphs. J. Graph Theory 103 (4) (2023)
Fábio Botler, Wanderson Lomenha, João Pedro de Souza
On nonrepetitive colorings of cycles. LAGOS (2023)
Fábio Botler, A. Jiménez, Carla Negri Lintzmayer, Adrián Pastine, D. A. Quiroz, Maycon Sambinelli
Biclique immersions in graphs with independence number 2. CoRR (2023)
Fábio Botler, Phablo F. S. Moura, Tássio Naia
Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. Discret. Math. 346 (12) (2023)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
Independent dominating sets in planar triangulations. CoRR (2023)
Fábio Botler, Luiz Hoffmann
 + 1. Discret. Math. 345 (8) (2022)
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
Counting orientations of graphs with no strongly connected tournaments. Discret. Math. 345 (12) (2022)
Fábio Botler, Maycon Sambinelli
Towards Gallai's path decomposition conjecture. J. Graph Theory 97 (1) (2021)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
On Tuza's conjecture for triangulations and graphs with small treewidth. Discret. Math. 344 (4) (2021)
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
Counting orientations of graphs with no strongly connected tournaments. CoRR (2021)
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
Counting orientations of graphs with no strongly connected tournaments. LAGOS (2021)
Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi
The 2-Decomposition Conjecture for a new class of graphs. LAGOS (2021)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
On Tuza's conjecture for triangulations and graphs with small treewidth. CoRR (2020)
Fábio Botler, Luiz Hoffmann
Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1. CoRR (2020)
Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota
Counting graph orientations with no directed triangles. CoRR (2020)
Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee
Gallai's path decomposition conjecture for graphs with treewidth at most 3. J. Graph Theory 93 (3) (2020)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. LAGOS (2019)
Fábio Botler, Andrea Jiménez, Maycon Sambinelli
Gallai's path decomposition conjecture for triangle-free planar graphs. Discret. Math. 342 (5) (2019)
Fábio Botler, Maycon Sambinelli
Towards Gallai's path decomposition conjecture. CoRR (2019)
Fábio Botler, R. Cano, Maycon Sambinelli
On Computing the Path Number of a Graph. LAGOS (2019)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decomposing highly connected graphs into paths of length five. Discret. Appl. Math. 245 (2018)
Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN (2018)
Fábio Botler, Andrea Jiménez, Maycon Sambinelli
Gallai's path decomposition conjecture for triangle-free planar graphs. CoRR (2018)
Fábio Botler, Andrea Jiménez
On path decompositions of 2k-regular graphs. Discret. Math. 340 (6) (2017)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decomposing regular graphs with prescribed girth into paths of given length. Eur. J. Comb. 66 (2017)
Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. CoRR (2017)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decomposing highly edge-connected graphs into paths of any given length. J. Comb. Theory, Ser. B 122 (2017)
Fábio Botler, Alexandre Talon
Decomposing 8-regular graphs into paths of length 4. Discret. Math. 340 (9) (2017)
Fábio Botler, Maycon Sambinelli
Gallai's conjecture for graphs with treewidth 3. Electron. Notes Discret. Math. 62 (2017)
Fábio Botler, Alexandre Talon
Decomposition of 8-regular graphs into paths of length 4. Electron. Notes Discret. Math. 61 (2017)
Fábio Botler, Alexandre Talon
Decomposing 8-regular graphs into paths of length 4. CoRR (2016)
Fábio Botler, Andrea Jiménez
On path decompositions of 2k-regular graphs. Electron. Notes Discret. Math. 50 (2015)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decompositions of highly connected graphs into paths of length five. Electron. Notes Discret. Math. 50 (2015)
Fábio Botler, Guilherme Oliveira Mota, Yoshiko Wakabayashi
Decompositions of triangle-free 5-regular graphs into paths of length five. Discret. Math. 338 (11) (2015)
Fábio Botler, Andrea Jiménez
On path decompositions of 2k-regular graphs. CoRR (2015)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decompositions of highly connected graphs into paths of any given length. Electron. Notes Discret. Math. 49 (2015)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Path decompositions of regular graphs with prescribed girth. Electron. Notes Discret. Math. 49 (2015)