default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHervé Hocquard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
On Inducing Degenerate Sums Through 2-Labellings. Graphs Comb. 40(2): 23 (2024)- 2023
- [j30]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. Comb. 43(1): 37-55 (2023) - [j29]Julien Bensmail, Hervé Hocquard, Dimitri Lajou:
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Theor. Comput. Sci. 939: 105-118 (2023) - [c5]Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. CALDAM 2023: 204-215 - 2022
- [j28]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): 1183-1212 (2022) - [j27]Julien Bensmail, Hervé Hocquard, Dimitri Lajou
, Éric Sopena:
Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. 307: 135-144 (2022) - [j26]Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
Going Wide with the 1-2-3 Conjecture. Discret. Appl. Math. 320: 15-32 (2022) - [j25]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. 38(3): 88 (2022) - [j24]Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between proper and strong edge-colorings of subcubic graphs. J. Graph Theory 101(4): 686-716 (2022) - [c4]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM 2022: 3-14 - [c3]Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel:
Robustness of Distances and Diameter in a Fragile Network. SAND 2022: 9:1-9:16 - 2021
- [j23]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: 74-89 (2021) - [j22]Florent Foucaud, Hervé Hocquard, Dimitri Lajou:
Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. 170: 106121 (2021) - [i9]Florent Foucaud, Hervé Hocquard, Dimitri Lajou:
Complexity and algorithms for injective edge-coloring in graphs. CoRR abs/2104.08003 (2021) - [i8]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A proof of the Multiplicative 1-2-3 Conjecture. CoRR abs/2108.10554 (2021) - 2020
- [j21]Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A connected version of the graph coloring game. Discret. Appl. Math. 283: 744-750 (2020) - [j20]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): 1175-1186 (2020) - [j19]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) - [j18]Hervé Hocquard, Jakub Przybylo:
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. J. Comb. Optim. 39(2): 412-424 (2020) - [c2]Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between Proper and Strong Edge-Colorings of Subcubic Graphs. IWOCA 2020: 355-367 - [i7]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR abs/2004.09090 (2020) - [i6]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. CoRR abs/2009.00843 (2020) - [i5]Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between proper and strong edge-colorings of subcubic graphs. CoRR abs/2011.02175 (2020)
2010 – 2019
- 2019
- [j17]Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena:
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270: 13-24 (2019) - [j16]Hervé Hocquard, Seog-Jin Kim, Théo Pierron:
Coloring squares of graphs with mad constraints. Discret. Appl. Math. 271: 64-73 (2019) - [j15]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) - [c1]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC 2019: 15:1-15:16 - [i4]Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A Connected Version of the Graph Coloring Game. CoRR abs/1907.12276 (2019) - [i3]Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR abs/1910.01099 (2019) - 2017
- [j14]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. 227: 29-43 (2017) - [j13]Hervé Hocquard, Jakub Przybylo:
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. Graphs Comb. 33(6): 1459-1471 (2017) - 2015
- [j12]Julien Bensmail, Marthe Bonamy, Hervé Hocquard:
Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49: 773-778 (2015) - 2014
- [j11]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179: 229-234 (2014) - [i2]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. CoRR abs/1401.4568 (2014) - [i1]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. CoRR abs/1412.6803 (2014) - 2013
- [j10]Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov:
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161(16-17): 2467-2479 (2013) - [j9]Hervé Hocquard, Pascal Ochem, Petru Valicov:
Strong edge-colouring and induced matchings. Inf. Process. Lett. 113(19-21): 836-843 (2013) - [j8]Hervé Hocquard, Mickaël Montassier:
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ. J. Comb. Optim. 26(1): 152-160 (2013) - 2011
- [b1]Hervé Hocquard:
Colorations de graphes sous contraintes. (Graph coloring under constraints). University of Bordeaux, France, 2011 - [j7]Hervé Hocquard, Petru Valicov:
Strong edge colouring of subcubic graphs. Discret. Appl. Math. 159(15): 1650-1657 (2011) - [j6]Hervé Hocquard, Mickaël Montassier:
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Electron. Notes Discret. Math. 38: 457-462 (2011) - [j5]Hervé Hocquard, Pascal Ochem, Petru Valicov:
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38: 463-468 (2011) - [j4]Hervé Hocquard:
Graphs with maximum degree 6 are acyclically 11-colorable. Inf. Process. Lett. 111(15): 748-753 (2011) - 2010
- [j3]Hervé Hocquard, Mickaël Montassier, André Raspaud:
A note on the acyclic 3-choosability of some planar graphs. Discret. Appl. Math. 158(10): 1104-1110 (2010)
2000 – 2009
- 2009
- [j2]Hervé Hocquard, Mickaël Montassier:
Acyclic choosability of planar graphs: a Steinberg like approach. Electron. Notes Discret. Math. 34: 199-205 (2009) - [j1]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): 1193-1196 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
