1 citations · 1 across the 1 of their papers we have counts for
5 papers
On the Erdős-Sloane and Shifted Sloane Persistence Problems
Gabriel Bonuccelli, Lucas Colucci, Edson de Faria
In this paper, we investigate two variations on the so-called persistence problem of Sloane: the shifted version, which was introduced by Wagstaff; and the nonzero version, propose…
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…
Edge colorings of graphs without monochromatic stars
Lucas Colucci, Ervin Győri, Abhishek Methuku
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph…
On L(2,1)-labelings of oriented graphs
Lucas Colucci, Ervin Győri
We extend a result of Griggs and Yeh about the maximum possible value of the L(2,1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the pr…