1 citations · 1 across the 6 of their papers we have counts for
8 papers · 1 filter
On converse invariant trees of diameter four
Fernando Afonso, Lucas Colucci, Tássio Naia
Let be an oriented graph, and let denote the number of copies of in a tournament . We say that is \emph{converse invariant} if for…
A linear upper bound on the zero-sum Ramsey number of forests in
Lucas Colucci, Marco D'Emidio
Let be a positive integer and let be a graph. The zero-sum Ramsey number is the least integer (if it exists) such that for every edge-coloring $χ\,…
On Modular Edge Colourings of Graphs
Gaétan Berthe, Marthe Bonamy, Fábio Botler +5
Given a graph and an integer , let denote the minimum number of colours required to colour the edges of such that, in each colour class, the subgraph ind…
On a problem of Caro on -Ramsey number of forests
José D. Alvarado, Lucas Colucci, Roberto Parente
Let be a positive integer and let be a graph. The zero-sum Ramsey number is the least integer (if it exists) such that for every edge-coloring $χ\,…
The mod chromatic index of graphs is
Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa
Let denote the minimum number of colors needed to color the edges of a graph in a way that the subgraph spanned by the edges of each color has all degrees congruent t…
On L(2,1)-labelings of some products of oriented cycles
Lucas Colucci, Ervin Győri
We refine two results of Jiang, Shao and Vesel on the -labeling number of the Cartesian and the strong product of two oriented cycles. For the Cartesian product, we com…