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 2015Show all

2 papers · 1 filter

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…

cs.DM2015

Incidence coloring of graphs with high maximum average degree

Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj +1

An incidence of an undirected graph G is a pair $(v, e)$ where $v$ is a vertex of $G$ and $e$ an edge of $G$ incident with $v$ . Two incidences $(v, e)$ and $(w, f)$ are adjacent if on…