22 citations · 22 across the 2 of their papers we have counts for
7 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…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…
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…
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,…
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…