The following pages link to Hervé Hocquard (Q324369):
Displayed 41 items.
- Strong edge coloring sparse graphs (Q324370) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Incidence coloring of planar graphs without adjacent small cycles (Q501990) (← links)
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- Item:Q324369 (redirect page) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs (Q2098173) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Going wide with the 1-2-3 conjecture (Q2166211) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
- Incidence coloring of graphs with high maximum average degree (Q2357131) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
- (Q2857387) (← links)
- (Q2857388) (← links)
- On locally irregular decompositions of subcubic graphs (Q4561210) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- From light edges to strong edge-colouring of 1-planar graphs (Q5130733) (← links)
- (Q5377221) (← links)
- (Q5419983) (← links)
- (Q5875547) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
- A proof of the multiplicative 1-2-3 conjecture (Q6057483) (← links)
- A proof of the multiplicative 1-2-3 conjecture (Q6102259) (← links)
- The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures (Q6132535) (← links)
- On inducing degenerate sums through 2-labellings (Q6154381) (← links)
- Between proper and strong edge-colorings of subcubic graphs (Q6352971) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q6365437) (← links)