Acyclic choosability of planar graphs: a Steinberg like approach. - Hervé Hocquard; Mickaël Montassier (Electron. Notes Discret. Math., 2009)

Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. - Hervé Hocquard; Mickaël Montassier (Inf. Process. Lett., 2009)

A note on the acyclic 3-choosability of some planar graphs. - Hervé Hocquard; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2010)

Strong edge colouring of subcubic graphs. - Hervé Hocquard; Petru Valicov (Discret. Appl. Math., 2011)

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. - Hervé Hocquard; Mickaël Montassier (Electron. Notes Discret. Math., 2011)

Bounds and complexity results for strong edge colouring of subcubic graphs. - Hervé Hocquard; Pascal Ochem; Petru Valicov (Electron. Notes Discret. Math., 2011)

Graphs with maximum degree 6 are acyclically 11-colorable. - Hervé Hocquard (Inf. Process. Lett., 2011)

Colorations de graphes sous contraintes. (Graph coloring under constraints). - Hervé Hocquard (2011)

On strong edge-colouring of subcubic graphs. - Hervé Hocquard; Mickaël Montassier; André Raspaud; Petru Valicov (Discret. Appl. Math., 2013)

Strong edge-colouring and induced matchings. - Hervé Hocquard; Pascal Ochem; Petru Valicov (Inf. Process. Lett., 2013)

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ. - Hervé Hocquard; Mickaël Montassier (J. Comb. Optim., 2013)

Strong edge-colouring of sparse planar graphs. - Julien Bensmail; Ararat Harutyunyan; Hervé Hocquard; Petru Valicov (Discret. Appl. Math., 2014)

Strong edge coloring sparse graphs. - Julien Bensmail; Marthe Bonamy; Hervé Hocquard (Electron. Notes Discret. Math., 2015)

Incidence coloring of graphs with high maximum average degree. - Marthe Bonamy; Hervé Hocquard; Samia Kerdjoudj; André Raspaud (Discret. Appl. Math., 2017)

On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. - Hervé Hocquard; Jakub Przybylo (Graphs Comb., 2017)

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (IPEC, 2019)

Edge weights and vertex colours: Minimizing sum count. - Olivier Baudon; Julien Bensmail; Hervé Hocquard; Mohammed Senhaji; Éric Sopena (Discret. Appl. Math., 2019)

Coloring squares of graphs with mad constraints. - Hervé Hocquard; Seog-Jin Kim; Théo Pierron (Discret. Appl. Math., 2019)

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. - Olivier Baudon; Julien Bensmail; Tom Davot; Hervé Hocquard; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2019)

A connected version of the graph coloring game. - Clément Charpentier; Hervé Hocquard; Éric Sopena; Xuding Zhu (Discret. Appl. Math., 2020)

On a total version of 1-2-3 Conjecture. - Olivier Baudon; Hervé Hocquard; Antoni Marczyk; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Discuss. Math. Graph Theory, 2020)

From light edges to strong edge-colouring of 1-planar graphs. - Julien Bensmail; François Dross; Hervé Hocquard; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2020)

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. - Hervé Hocquard; Jakub Przybylo (J. Comb. Optim., 2020)

Exact square coloring of subcubic planar graphs. - Florent Foucaud; Hervé Hocquard; Suchismita Mishra 001; Narayanan Narayanan; Reza Naserasr; Éric Sopena; Petru Valicov (Discret. Appl. Math., 2021)

Complexity and algorithms for injective edge-coloring in graphs. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou (Inf. Process. Lett., 2021)

Robustness of Distances and Diameter in a Fragile Network. - Arnaud Casteigts; Timothée Corsini; Hervé Hocquard; Arnaud Labourel (SAND, 2022)

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (Algorithmica, 2022)

Further evidence towards the multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Discret. Appl. Math., 2022)

Going Wide with the 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Pierre-Marie Marcille (Discret. Appl. Math., 2022)

On a List Variant of the Multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Graphs Comb., 2022)

Between proper and strong edge-colorings of subcubic graphs. - Hervé Hocquard; Dimitri Lajou; Borut Luzar (J. Graph Theory, 2022)

The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. - Julien Bensmail; Hervé Hocquard; Pierre-Marie Marcille (CALDAM, 2023)

On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou (Theor. Comput. Sci., 2023)

A Proof of the Multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Comb., 2023)

On Inducing Degenerate Sums Through 2-Labellings. - Julien Bensmail; Hervé Hocquard; Pierre-Marie Marcille (Graphs Comb., 2024)

On 1-2-3 Conjecture-like problems in 2-edge-coloured graphs. - Julien Bensmail; Hervé Hocquard; Clara Marcille; Sven Meyer (Discret. Math., 2025)

Adding direction constraints to the 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Clara Marcille (Theor. Comput. Sci., 2025)

Irregularity Notions for Digraphs. - Julien Bensmail; Thomas Filasto; Hervé Hocquard; Clara Marcille (Graphs Comb., 2025)