Hervé Hocquard

According to our database, Hervé Hocquard authored at least 35 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

On Inducing Degenerate Sums Through 2-Labellings.

Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille

Graphs Comb., April, 2024

2023

A Proof of the Multiplicative 1-2-3 Conjecture.

Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena

Comb., February, 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

The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures.

Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Between proper and strong edge-colorings of subcubic graphs.

Hervé Hocquard, Dimitri Lajou, Borut Luzar

J. Graph Theory, 2022

On a List Variant of the Multiplicative 1-2-3 Conjecture.

Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena

Graphs Comb., 2022

Going Wide with the 1-2-3 Conjecture.

Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille

Discret. Appl. Math., 2022

Further evidence towards the multiplicative 1-2-3 Conjecture.

Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena

Discret. Appl. Math., 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

Robustness of Distances and Diameter in a Fragile Network.

Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021

Complexity and algorithms for injective edge-coloring in graphs.

Florent Foucaud, Hervé Hocquard, Dimitri Lajou

Inf. Process. Lett., 2021

Exact square coloring of subcubic planar graphs.

Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov

Discret. Appl. Math., 2021

2020

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree.

Hervé Hocquard, Jakub Przybylo

J. Comb. Optim., 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 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

A connected version of the graph coloring game.

Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu

Discret. Appl. Math., 2020

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

Coloring squares of graphs with mad constraints.

Hervé Hocquard, Seog-Jin Kim, Théo Pierron

Discret. Appl. Math., 2019

Edge weights and vertex colours: Minimizing sum count.

Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena

Discret. Appl. Math., 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.

Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2017

On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree.

Hervé Hocquard, Jakub Przybylo

Graphs Comb., 2017

Incidence coloring of graphs with high maximum average degree.

Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud

Discret. Appl. Math., 2017

2015

Strong edge coloring sparse graphs.

Julien Bensmail, Marthe Bonamy, Hervé Hocquard

Electron. Notes Discret. Math., 2015

2014

Strong edge-colouring of sparse planar graphs.

Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov

Discret. Appl. Math., 2014

2013

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ.

Hervé Hocquard, Mickaël Montassier

J. Comb. Optim., 2013

Strong edge-colouring and induced matchings.

Hervé Hocquard, Pascal Ochem, Petru Valicov

Inf. Process. Lett., 2013

On strong edge-colouring of subcubic graphs.

Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov

Discret. Appl. Math., 2013

2011

Colorations de graphes sous contraintes. (Graph coloring under constraints).

Hervé Hocquard

PhD thesis, 2011

Graphs with maximum degree 6 are acyclically 11-colorable.

Hervé Hocquard

Inf. Process. Lett., 2011

Bounds and complexity results for strong edge colouring of subcubic graphs.

Hervé Hocquard, Pascal Ochem, Petru Valicov

Electron. Notes Discret. 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

Strong edge colouring of subcubic graphs.

Hervé Hocquard, Petru Valicov

Discret. Appl. Math., 2011

2010

A note on the acyclic 3-choosability of some planar graphs.

Hervé Hocquard, Mickaël Montassier, André Raspaud

Discret. Appl. Math., 2010

2009

Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable.

Hervé Hocquard, Mickaël Montassier

Inf. Process. Lett., 2009

Acyclic choosability of planar graphs: a Steinberg like approach.

Hervé Hocquard, Mickaël Montassier

Electron. Notes Discret. Math., 2009