Edge Weights and Vertex Colours: Minimizing Sum Count, Discrete Applied Mathematics, vol.270, pp.13-24, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01839537
A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998. ,
Vertex-coloring edge-weightings of graphs, Taiwanese Journal of Mathematics, vol.15, issue.4, pp.1807-1813, 2011. ,
On the complexity of vertex-coloring edge-weightings, Discrete Mathematics Theoretical Computer Science, vol.13, issue.3, pp.45-50, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00990502
A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics, vol.6, 1997. ,
Vertex-coloring edge-weightings: towards the 1-2-3 Conjecture, Journal of Combinatorial Theory, Series B, vol.100, pp.347-349, 2010. ,
Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, pp.151-157, 2004. ,
Hard Tiling Problems with Simple Tiles. Discrete and Computational Geometry, vol.26, pp.573-590, 2001. ,
The 1-2-3 Conjecture and related problems: a survey, 2012. ,
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture, Journal of Combinatorial Theory, Series B, vol.121, pp.308-325, 2016. ,