H. Hocquard

activity

20142021

most citedComplexity and algorithms for injective edge-coloring in graphs

22 citations · 51 across the 10 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2021

On a List Variant of the Multiplicative 1-2-3 Conjecture

Julien Bensmail, Hervé Hocquard, Dimitri Lajou +1

The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with $1, 2, 3$ so that no two adjacent vertices are incident to the same sum of labels. In the last decades…

math.CO2019

Coloring squares of graphs with mad constraints

Hervé Hocquard, Seog-Jin Kim, Théo Pierron

A proper vertex $k$ -coloring of a graph $G = (V, E)$ is an assignment $c : V \to {1, 2, \dots, k}$ of colors to the vertices of the graph such that no two adjacent vertices are associate…

math.CO2018

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree

Hervé Hocquard, Jakub Przybyło

A proper total $k$ -colouring of a graph $G = (V, E)$ is an assignment $c : V \cup E \to {1, 2, \dots, k}$ of colours to the edges and the vertices of $G$ such that no two adjacent edge…

math.CO2015★ 7 cited

On the neighbour sum distinguishing index of graphs with bounded maximum average degree

Hervé Hocquard, Jakub Przybyło

A proper edge $k$ -colouring of a graph $G = (V, E)$ is an assignment $c : E \to {1, 2, \dots, k}$ of colours to the edges of the graph such that no two adjacent edges are associated with…