5 citations · 24 across the 16 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 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 …
cs.DS2019★ 5 cited
Complexity of planar signed graph homomorphisms to cycles
François Dross, Florent Foucaud, Valia Mitsou +2
We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs…