15 citations · 20 across the 7 of their papers we have counts for
10 papers
On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture
F. Botler, A. Jiménez, M. Sambinelli +1
The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph with vertices of degree 2 an…
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 contains an immersion of . For graphs with independence number 2, this is equ…
Gallai's path decomposition conjecture for triangle-free planar graphs
Fábio Botler, Andrea Jiménez, Maycon Sambinelli
A path decomposition of a graph is a collection of edge-disjoint paths of that covers the edge set of . Gallai (1968) conjectured that every connected graph on verti…
Maximum number of sum-free colorings in finite abelian groups
Hiep Hàn, Andrea Jiménez
An -coloring of a subset of a finite abelian group is called sum-free if it does not induce a monochromatic Schur triple, i.e., a triple of elements with $a…
On path decompositions of 2k-regular graphs
Fábio Botler, Andrea Jiménez
Tibor Gallai conjectured that the edge set of every connected graph on vertices can be partitioned into paths. Let be the class of all…
Directed cycle double covers and cut-obstacles
Andrea Jiménez, Martin Loebl
A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cy…