Fábio Botler

According to our database1, Fábio Botler authored at least 19 papers between 2015 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Gallai's path decomposition conjecture for graphs with treewidth at most 3.
J. Graph Theory, 2020

Counting graph orientations with no directed triangles.
CoRR, 2020

2019
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Computing the Path Number of a Graph.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Gallai's path decomposition conjecture for triangle-free planar graphs.
Discret. Math., 2019

Towards Gallai's path decomposition conjecture.
CoRR, 2019

2018
Decomposing highly connected graphs into paths of length five.
Discret. Appl. Math., 2018

SUPERSET: A (Super)Natural Variant of the Card Game SET.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Decomposing highly edge-connected graphs into paths of any given length.
J. Comb. Theory, Ser. B, 2017

Decomposition of 8-regular graphs into paths of length 4.
Electron. Notes Discret. Math., 2017

Gallai's conjecture for graphs with treewidth 3.
Electron. Notes Discret. Math., 2017

Decomposing regular graphs with prescribed girth into paths of given length.
Eur. J. Comb., 2017

Decomposing 8-regular graphs into paths of length 4.
Discret. Math., 2017

On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3.
CoRR, 2017

2015
Decompositions of highly connected graphs into paths of length five.
Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of any given length.
Electron. Notes Discret. Math., 2015

Path decompositions of regular graphs with prescribed girth.
Electron. Notes Discret. Math., 2015

On path decompositions of 2k-regular graphs.
Electron. Notes Discret. Math., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.
Discret. Math., 2015


  Loading...