Hervé Hocquard

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 32

Top Venues

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
On Inducing Degenerate Sums Through 2-Labellings. Graphs Comb. 40 (2) (2024)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A Proof of the Multiplicative 1-2-3 Conjecture. Comb. 43 (1) (2023)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Theor. Comput. Sci. 939 (2023)
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. CALDAM (2023)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. 307 (2022)
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
Going Wide with the 1-2-3 Conjecture. Discret. Appl. Math. 320 (2022)
Hervé Hocquard, Dimitri Lajou, Borut Luzar
Between proper and strong edge-colorings of subcubic graphs. J. Graph Theory 101 (4) (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. 38 (3) (2022)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84 (5) (2022)
Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel
Robustness of Distances and Diameter in a Fragile Network. SAND (2022)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293 (2021)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. 170 (2021)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs. CoRR (2021)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A proof of the Multiplicative 1-2-3 Conjecture. CoRR (2021)
Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40 (4) (2020)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. CoRR (2020)
Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena
From light edges to strong edge-colouring of 1-planar graphs. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Hervé Hocquard, Jakub Przybylo
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. J. Comb. Optim. 39 (2) (2020)
Hervé Hocquard, Dimitri Lajou, Borut Luzar
Between Proper and Strong Edge-Colorings of Subcubic Graphs. IWOCA (2020)
Hervé Hocquard, Dimitri Lajou, Borut Luzar
Between proper and strong edge-colorings of subcubic graphs. CoRR (2020)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR (2020)
Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu
A connected version of the graph coloring game. Discret. Appl. Math. 283 (2020)
Hervé Hocquard, Seog-Jin Kim, Théo Pierron
Coloring squares of graphs with mad constraints. Discret. Appl. Math. 271 (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR (2019)
Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270 (2019)
Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu
A Connected Version of the Graph Coloring Game. CoRR (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC (2019)
Hervé Hocquard, Jakub Przybylo
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. Graphs Comb. 33 (6) (2017)
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. 227 (2017)
Julien Bensmail, Marthe Bonamy, Hervé Hocquard
Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49 (2015)
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
Incidence coloring of graphs with high maximum average degree. CoRR (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179 (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. CoRR (2014)
Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161 (16-17) (2013)
Hervé Hocquard, Pascal Ochem, Petru Valicov
Strong edge-colouring and induced matchings. Inf. Process. Lett. 113 (19-21) (2013)
Hervé Hocquard, Mickaël Montassier
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ. J. Comb. Optim. 26 (1) (2013)
Hervé Hocquard, Pascal Ochem, Petru Valicov
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38 (2011)
Hervé Hocquard, Petru Valicov
Strong edge colouring of subcubic graphs. Discret. Appl. Math. 159 (15) (2011)
Hervé Hocquard, Mickaël Montassier
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Electron. Notes Discret. Math. 38 (2011)
Hervé Hocquard
Graphs with maximum degree 6 are acyclically 11-colorable. Inf. Process. Lett. 111 (15) (2011)
Hervé Hocquard, Mickaël Montassier, André Raspaud
A note on the acyclic 3-choosability of some planar graphs. Discret. Appl. Math. 158 (10) (2010)
Hervé Hocquard, Mickaël Montassier
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Inf. Process. Lett. 109 (21-22) (2009)
Hervé Hocquard, Mickaël Montassier
Acyclic choosability of planar graphs: a Steinberg like approach. Electron. Notes Discret. Math. 34 (2009)

Hervé Hocquard.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hervé Hocquard