Fábio Botler

According to our database, Fábio Botler authored at least 34 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

On nonrepetitive colorings of paths and cycles.

Fábio Botler, Wanderson Lomenha, João Pedro de Souza

Discret. Appl. Math., 2025

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., October, 2024

Biclique immersions in graphs with independence number 2.

Fábio Botler, Andrea Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel Quiroz, Maycon Sambinelli

Eur. J. Comb., 2024

Ramsey Goodness of paths and unbalanced graphs.

Fábio Botler, Luiz Moreira, João Pedro de Souza

CoRR, 2024

Separating the edges of a graph by cycles and by subdivisions of K₄.

Fábio Botler, Tássio Naia

CoRR, 2024

Independent Dominating Sets in Planar Triangulations.

Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez

Electron. J. Comb., 2024

2023

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs.

Fábio Botler, Phablo F. S. Moura, Tássio Naia

Discret. Math., December, 2023

The mod k $k$ chromatic index of random graphs.

Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa

J. Graph Theory, August, 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

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

On nonrepetitive colorings of cycles.

Fábio Botler, Wanderson Lomenha, João Pedro de Souza

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Counting orientations of graphs with no strongly connected tournaments.

Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota

Discret. Math., 2022

Decomposition of (2<i>k</i> + 1)-regular graphs containing special spanning 2<i>k</i>-regular Cayley graphs into paths of length 2<i>k</i> + 1.

Fábio Botler, Luiz Hoffmann

Discret. Math., 2022

2021

Towards Gallai's path decomposition conjecture.

Fábio Botler, Maycon Sambinelli

J. Graph Theory, 2021

The 2-Decomposition Conjecture for a new class of graphs.

Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

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

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

Counting graph orientations with no directed triangles.

Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota

CoRR, 2020

2019

On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth.

Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Computing the Path Number of a Graph.

Fábio Botler, R. Cano, Maycon Sambinelli

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Gallai's path decomposition conjecture for triangle-free planar graphs.

Fábio Botler, Andrea Jiménez, Maycon Sambinelli

Discret. Math., 2019

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

SUPERSET: A (Super)Natural Variant of the Card Game SET.

Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

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

Decomposition of 8-regular graphs into paths of length 4.

Fábio Botler, Alexandre Talon

Electron. Notes Discret. Math., 2017

Gallai's conjecture for graphs with treewidth 3.

Fábio Botler, Maycon Sambinelli

Electron. Notes 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

Decomposing 8-regular graphs into paths of length 4.

Fábio Botler, Alexandre Talon

Discret. Math., 2017

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

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

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

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

On path decompositions of 2k-regular graphs.

Fábio Botler, Andrea Jiménez

Electron. Notes Discret. Math., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.

Fábio Botler, Guilherme Oliveira Mota, Yoshiko Wakabayashi

Discret. Math., 2015