activity
20192026
most citedComplexity and algorithms for injective edge-coloring in graphs

22 citations · 33 across the 7 of their papers we have counts for

collaborators
Showing 2019 · cs.DSShow all

1 paper · 2 filters

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 …