Fábio Botler

fbotler at dii.uchile.cl

Ph.D. in Computer Science
Centre for Research and Modeling of Random Phenomena
Facultad de Ingeniería
Universidad de Valparaíso


Curriculum Vitae
Curriculum Lattes

Main Research Interests

Papers

  • Gallai's path decomposition conjecture for triangle-free planar graphs,
           preprint (with M. Sambinelli, A. Jiménez).
  • On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3,
           preprint (with M. Sambinelli, R. S. Coelho, O. Lee).
  • Decomposing 8-regular graphs into paths of length 4,
           Discrete Mathematics, Vol. 340, Issue 9, p. 2275–2285, 2017 (with A. Talon).
  • Decomposing regular graphs with prescribed girth into paths with given length,
           European Journal of Combinatorics, Vol. 66, p. 28-36, 2017 (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • On path decompositions of 2k-regular graphs,
           Discrete Mathematics, Vol. 340, Issue 6, p. 1405-1411, 2017 (with A. Jiménez).
  • Decompositions of highly connected graphs into paths of any given length,
           Journal of Combinatorial Theory, Series B, Vol. 122, p. 508-542, 2017
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Decomposing highly connected graphs into paths of length five,
           to appear in Discrete Applied Mathematics (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Decompositions of triangle-free 5-regular graphs into paths of length five,
           Discrete Mathematics, Vol. 338, Issue 11 p. 1845-1855, 2015 (with G. O. Mota, Y. Wakabayashi).
  • Extended abstracts

  • Gallai's Conjecture for graphs with treewidth 3,
           IX Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2017
           (with M. Sambinelli).
  • On a joint technique for Hajós' and Gallai's Conjectures,
           Congresso da Sociedade Brasileira de Computação, CSBC 2017
           (with M. Sambinelli, R. S. Coelho, O. Lee).
  • Decomposing 8-regular graphs into paths of length 4,
           Electronic Notes in Discrete Mathematics 61 (2017), 147–153,
           The Ninth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017
           (with A. Talon).
  • Decompositions of highly connected graphs into paths of any given length,
           Electronic Notes in Discrete Mathematics 49 (2015), 795-802,
           The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Path decompositions of regular graphs with prescribed girth,
           Electronic Notes in Discrete Mathematics 49 (2015), 629-636,
           The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • On path decompositions of 2k-regular graphs,
           Electronic Notes in Discrete Mathematics 50 (2015), 163-168,
           VIII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2015
           (with A. Jiménez).
  • Decompositions of highly connected graphs into paths of length five,
           Electronic Notes in Discrete Mathematics 50 (2015), 211-216,
           VIII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2015
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Path decompositions of triangle-free 5-regular graphs,
           ICGT 2014 (with G. O. Mota, Y. Wakabayashi).
  • A constrained path decomposition of cubic graphs and the path number of cacti,
            Eurocomb 2013 (with Y. Wakabayashi).
  • Theses

  • Decomposição de Grafos em Caminhos,
            Ph.D. Thesis (in portuguese).
  • Decomposition of Graphs into Paths,
            Extended abstract of my Ph.D. Thesis submitted to CLTD - CLEI 2016.
  • Research and Study Groups

    Last modified: Seg Mar 19 22:53:27 -03 2018
    This website style was gently copied from Tássio Naia dos Santos