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
Equitable neighbour-sum-distinguishing edge and total colourings, Discrete Applied Mathematics, vol.222, pp.40-53, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01330531
On Proper Labellings of Graphs with Minimum Label Sum, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02450521
On Minimizing the Maximum Color for the 1-2-3 Conjecture, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02330418
Vertex-coloring edge-weightings of graphs, Taiwanese Journal of Mathematics, vol.15, pp.1807-1813, 2011. ,
How to define an irregular graph, The College Mathematics Journal, vol.19, pp.36-42, 1998. ,
, Graduate texts in mathematics, vol.173, 2012.
On the complexity of vertex-coloring edge-weightings, Discrete Mathematics and Theoretical Computer Science, vol.13, pp.45-50, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00990502
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.3, pp.347-349, 2010. ,
Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.151-157, 2004. ,
Minimum-weight triangulation is NP-hard, Journal of the ACM, vol.55, 2006. ,
The 1-2-3 conjecture almost holds for regular graphs, 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. ,