Spremljaj
Hervé Hocquard
Hervé Hocquard
LaBRI
Preverjeni e-poštni naslov na labri.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
H Hocquard, M Montassier
Journal of Combinatorial Optimization 26 (1), 152-160, 2013
562013
Strong edge-colouring of sparse planar graphs
J Bensmail, A Harutyunyan, H Hocquard, P Valicov
Discrete Applied Mathematics 179, 229-234, 2014
372014
On strong edge-colouring of subcubic graphs
H Hocquard, M Montassier, A Raspaud, P Valicov
Discrete Applied Mathematics 161 (16-17), 2467-2479, 2013
372013
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
H Hocquard, M Montassier
Electronic Notes in Discrete Mathematics 38, 457-462, 2011
332011
Strong edge-colouring and induced matchings
H Hocquard, P Ochem, P Valicov
Information Processing Letters 113 (19-21), 836-843, 2013
322013
Strong edge colouring of subcubic graphs
H Hocquard, P Valicov
Discrete Applied Mathematics 159 (15), 1650-1657, 2011
242011
Adjacent vertex-distinguishing edge coloring of graphs
M Bonamy, N Bousquet, H Hocquard
The Seventh European Conference on Combinatorics, Graph Theory and …, 2013
222013
Complexity and algorithms for injective edge-coloring in graphs
F Foucaud, H Hocquard, D Lajou
Information Processing Letters 170, 106121, 2021
172021
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
O Baudon, J Bensmail, T Davot, H Hocquard, J Przybyło, M Senhaji, ...
Discrete Mathematics & Theoretical Computer Science 21, 2019
142019
Graphs with maximum degree 6 are acyclically 11-colorable
H Hocquard
Information processing letters 111 (15), 748-753, 2011
142011
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
H Hocquard, M Montassier
Information processing letters 109 (21-22), 1193-1196, 2009
142009
Edge weights and vertex colours: minimizing sum count
O Baudon, J Bensmail, H Hocquard, M Senhaji, E Sopena
Discrete Applied Mathematics 270, 13-24, 2019
122019
Exact square coloring of subcubic planar graphs
F Foucaud, H Hocquard, S Mishra, N Narayanan, R Naserasr, E Sopena, ...
Discrete Applied Mathematics 293, 74-89, 2021
112021
Between proper and strong edge‐colorings of subcubic graphs
H Hocquard, D Lajou, B Lužar
Journal of Graph Theory 101 (4), 686-716, 2022
102022
A connected version of the graph coloring game
C Charpentier, H Hocquard, É Sopena, X Zhu
Discrete Applied Mathematics 283, 744-750, 2020
102020
On the neighbour sum distinguishing index of graphs with bounded maximum average degree
H Hocquard, J Przybyło
Graphs and Combinatorics 33, 1459-1471, 2017
102017
Strong edge coloring sparse graphs
J Bensmail, M Bonamy, H Hocquard
Electronic Notes in Discrete Mathematics 49, 773-778, 2015
102015
Incidence coloring of graphs with high maximum average degree
M Bonamy, H Hocquard, S Kerdjoudj, A Raspaud
Discrete Applied Mathematics 227, 29-43, 2017
82017
A proof of the Multiplicative 1-2-3 Conjecture
J Bensmail, H Hocquard, D Lajou, É Sopena
Combinatorica 43 (1), 37-55, 2023
72023
On locally irregular decompositions of subcubic graphs
O Baudon, J Bensmail, H Hocquard, M Senhaji, E Sopena
Opuscula Mathematica 38 (6), 795-817, 2018
72018
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20