22 citations · 33 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Florent Foucaud, Hervé Hocquard, Dimitri Lajou +2
We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from edge-coloured graph …
math.CO2019
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…