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
On decomposing regular graphs into locally irregular subgraphs, European Journal of Combinatorics, vol.49, pp.90-104, 2015. ,
Equitable neighbour-sum-distinguishing edge and total colourings, Discrete Applied Mathematics, vol.222, pp.40-53, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01433783
On {a, b}-edge-weightings of bipartite graphs with odd a, b ,
URL : https://hal.archives-ouvertes.fr/hal-01988399
On Minimizing the Maximum Color for the 1-2-3 Conjecture, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02330418
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. ,
How to define an irregular graph, College Mathematics Journal, vol.19, issue.1, 1988. ,
, Irregular networks. Congressus Numerantium, vol.64, pp.197-210, 1988.
On the complexity of verterx-coloring edge-weightings, Discrete Mathematics Theoretical Computer Science, vol.13, issue.3, pp.45-50, 2011. ,
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. ,
Vertex-colouring 2-edge-weightings of graphs, European Journal of Combinatorics, vol.32, pp.21-27, 2011. ,
Minimum-weight triangulation is NP-hard, Journal of the ACM, vol.55, issue.2, p.11, 2008. ,
The 1-2-3 Conjecture almost holds for regular graphs, 2018. ,
The 1-2-3 Conjecture and related problems: a survey, 2012. ,
On neighbour sum-distinguishing {0, 1}-weightings of bipartite graphs, Discrete Mathematics and Theoretical Computer Science, vol.20, issue.1, p.21, 2018. ,
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. ,