F. Botler

activity

20152025

most citedSeparating the edges of a graph by a linear number of paths

9 citations · 33 across the 19 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

On nonrepetitive colorings of paths and cycles

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

We say that a sequence $a_{1} \dots a_{2 t}$ of integers is repetitive if $a_{i} = a_{i + t}$ for every $i \in {1, \dots, t}$ . A walk in a graph $G$ is a sequence $v_{1} \dots v_{r}$ of vert…

math.CO2023

Independent dominating sets in planar triangulations

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

In 1996, Matheson and Tarjan proved that every near planar triangulation on $n$ vertices contains a dominating set of size at most $n /3$ , and conjectured that this upper bound can…

math.CO2023★ 4 cited

Biclique immersions in graphs with independence number 2

Fábio Botler, Andrea Jiménez, Carla N. Lintzmayer +3

The analogue of Hadwiger's conjecture for the immersion relation states that every graph $G$ contains an immersion of $K_{χ (G)}$ . For graphs with independence number 2, this is equ…

math.CO2023★ 9 cited

Separating the edges of a graph by a linear number of paths

Marthe Bonamy, Fábio Botler, François Dross +2

Recently, Letzter proved that any graph of order $n$ contains a collection $P$ of $O (n lo g^{⋆} n)$ paths with the following property: for all distinct edges $e$ and $f$ …