22 citations · 22 across the 2 of their papers we have counts for
5 papers
Complexity and algorithms for injective edge-coloring in graphs
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
An injective -edge-coloring of a graph is an assignment of colors, i.e. integers in , to the edges of such that any two edges each incident with one d…
On a List Variant of the Multiplicative 1-2-3 Conjecture
Julien Bensmail, Hervé Hocquard, Dimitri Lajou +1
The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with so that no two adjacent vertices are incident to the same sum of labels. In the last decades…
On Cartesian products of signed graphs
Dimitri Lajou
In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromat…
Further Evidence Towards the Multiplicative 1-2-3 Conjecture
Julien Bensmail, Hervé Hocquard, Dimitri Lajou +1
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{ó}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two…
On the achromatic number of signed graphs
Dimitri Lajou
In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different…