22 citations · 51 across the 10 of their papers we have counts for
Showing 2019Show all
3 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 …
cs.DM2019
A Connected Version of the Graph Coloring Game
Eric Sopena, Clément Charpentier, Hervé Hocquard +1
The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G,…
math.CO2019
Coloring squares of graphs with mad constraints
Hervé Hocquard, Seog-Jin Kim, Théo Pierron
A proper vertex -coloring of a graph is an assignment of colors to the vertices of the graph such that no two adjacent vertices are associate…