Hervé Hocquard

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