Hervé Hocquard

From MaRDI portal
Revision as of 01:48, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Hervé Hocquard to Hervé Hocquard: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:324369

Available identifiers

zbMath Open hocquard.herveMaRDI QIDQ324369

List of research outcomes





PublicationDate of PublicationType
Adding direction constraints to the 1-2-3 conjecture2024-12-12Paper
On inducing degenerate sums through 2-labellings2024-02-15Paper
Between proper and strong edge‐colorings of subcubic graphs2023-10-05Paper
A proof of the multiplicative 1-2-3 conjecture2023-10-04Paper
The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures2023-08-17Paper
A proof of the multiplicative 1-2-3 conjecture2023-05-08Paper
https://portal.mardi4nfdi.de/entity/Q58755472023-02-03Paper
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs2022-11-17Paper
Between Proper and Strong Edge-Colorings of Subcubic Graphs2022-10-13Paper
Going wide with the 1-2-3 conjecture2022-08-24Paper
On a list variant of the multiplicative 1-2-3 conjecture2022-05-09Paper
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity2022-05-03Paper
Further evidence towards the multiplicative 1-2-3 conjecture2021-12-07Paper
Complexity and algorithms for injective edge-coloring in graphs2021-06-16Paper
Complexity and algorithms for injective edge-coloring in graphs2021-04-16Paper
Exact square coloring of subcubic planar graphs2021-03-25Paper
Between proper and strong edge-colorings of subcubic graphs2020-11-04Paper
From light edges to strong edge-colouring of 1-planar graphs2020-10-28Paper
On a total version of 1-2-3 conjecture2020-08-26Paper
A connected version of the graph coloring game2020-06-29Paper
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree2020-02-03Paper
Coloring squares of graphs with mad constraints2019-11-27Paper
Edge weights and vertex colours: minimizing sum count2019-11-06Paper
https://portal.mardi4nfdi.de/entity/Q53772212019-05-23Paper
On locally irregular decompositions of subcubic graphs2018-12-10Paper
On the neighbour sum distinguishing index of graphs with bounded maximum average degree2018-02-14Paper
Incidence coloring of graphs with high maximum average degree2017-06-19Paper
Incidence coloring of planar graphs without adjacent small cycles2017-01-10Paper
Strong edge coloring sparse graphs2016-10-14Paper
Strong edge-colouring of sparse planar graphs2014-12-03Paper
https://portal.mardi4nfdi.de/entity/Q54199832014-06-11Paper
Strong edge-colouring and induced matchings2014-04-14Paper
On strong edge-colouring of subcubic graphs2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q28573872013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573882013-11-01Paper
Acyclic choosability of planar graphs: a Steinberg like approach2013-10-10Paper
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)2013-08-09Paper
Graphs with maximum degree \(6\) are acyclically \(11\)-colorable2013-04-04Paper
Strong edge colouring of subcubic graphs2011-10-27Paper
A note on the acyclic 3-choosability of some planar graphs2010-10-11Paper
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable2010-09-01Paper

Research outcomes over time

This page was built for person: Hervé Hocquard