Fábio Botler
Ph.D. in Computer Science
fbotler at cos.ufrj.br

Programa de Engenharia de Sistemas e Computação
Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa em Engenharia
Universidade Federal do Rio de Janeiro

Papers

  • A short proof of the bijection between minimal feedback arc sets and Hamiltonian paths in tournaments,
            Matemática Contemporâne, Volume 55, 2023, 10th LAWCG – Latin American Workshop on Cliques in Graphs (with R. Schneider, ).
  • On the structure of a smallest counterexample and
    a new class verifying the 2-Decomposition Conjecture
    ,
            preprint (with A. Jiménez, M. Sambinelli, Y. Wakabayashi ).
  • On nonrepetitive colorings of paths and cycles,
            preprint (with W. Lomenha, J. P. de Souza).
  • Independent dominating sets in planar triangulations,
            preprint (with C. G. Fernandes, Juan Gutiérrez).
  • Biclique immersions in graphs with independence number 2,
            preprint (with A. Jiménez, C. N. Lintzmayer , A. Pastine, D. Quiroz, M. Sambinelli).
  • Separating the edges of a graph by a linear number of paths,
            Advances in Combinatorics (with Marthe Bonamy, François Dross, Tássio Naia, Jozef Skokan).
  • Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs,
            Discrete Mathematics, Volume 346, Issue 12, 2023 (with Phablo F. S. Moura, Tássio Naia).
  • The modk chromatic index of random graphs,
            Journal of Graph Theory, 2023 (with L. Colucci, Y. Kohayakawa).
  • Counting orientations of graphs with no strongly connected tournaments,
            Discrete Mathematics, Volume 345, Issue 12, 2022 (with C. Hoppen, G. O. Mota).
  • The mod k chromatic index of graphs is O(k),
            Journal of Graph Theory, 2022 (with L. Colucci, Y. Kohayakawa).
  • Counting graph orientations with no directed triangles,
            preprint (with P. Araújo, G. O. Mota).
  • Decomposition of (2k+1)-regular graphs
    containing special spanning 2k-regular Cayley graphs into paths of length 2k+1
    ,
            Discrete Mathematics, Volume 345, Issue 8, 2022 (with L. Hoffmann).
  • On Tuza's conjecture for triangulations and graphs with small treewidth,
            Discrete Mathematics, Volume 344, Issue 4, 2021 (with C. G. Fernandes, Juan Gutiérrez).
  • Decomposition of graphs into trees with bounded maximum degree,
            Matemática Contemporânea, Volume 46, 2018, 8th Latin-American Workshop on Cliques in Graphs.
  • Towards Gallai's path decomposition conjecture,
            Journal of Graph Theory, 2020 (with M. Sambinelli).
  • Gallai's path decomposition conjecture for triangle-free planar graphs,
            Discrete Mathematics, Volume 342, Issue 5, 1403-1414, 2019 (with M. Sambinelli, A. Jiménez).
            Editors' Choice selections for 2019
  • Gallai's path decomposition conjecture for graphs with treewidth at most 3,
            Journal of Graph Theory, 2019 (with M. Sambinelli, R. S. Coelho, O. Lee - see also the preprint).
  • SUPERSET: A (Super)Natural Variant of the Card Game SET,
            Leibniz International Proceedings in Informatics (LIPIcs), Vol. 100, p. 12:1-12:17, 2018
           (with A. Cristi, R. Hoeksma, K. Schewior, A. Tönnis).
  • 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,
           Discrete Applied Mathematics, Vol. 245, p. 128-138, 2018 (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).


  • Last modified on seg 23-12-18 14:03
    This website style was gently copied from Tássio Naia