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 2015Show all

3 papers · 1 filter

cs.DM2015

On path decompositions of 2k-regular graphs

Fábio Botler, Andrea Jiménez

Tibor Gallai conjectured that the edge set of every connected graph $G$ on $n$ vertices can be partitioned into $⌈ n /2 ⌉$ paths. Let $G_{k}$ be the class of all…

math.CO2015★ 5 cited

Decomposing highly edge-connected graphs into paths of any given length

Fabio Botler, Guilherme O. Mota, Marcio T. I. Oshiro +1

In 2006, Barát and Thomassen posed the following conjecture: for each tree $T$ , there exists a natural number $k_{T}$ such that, if $G$ is a $k_{T}$ -edge-connected graph and $∣ E (G) ∣$ i…

math.CO2015★ 4 cited

Decompositions of highly connected graphs into paths of length five

Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro +1

We study the Decomposition Conjecture posed by Barát and Thomassen (2006), which states that for every tree $T$ there exists a natural number $k_{T}$ such that, if $G$ is a $k_{T}$ -edg…