On the 1-2 Conjecture in digraphs ,
URL : https://hal.archives-ouvertes.fr/hal-01374427
On decomposing regular graphs into locally irregular subgraphs, European Journal of Combinatorics, vol.49, pp.90-104, 2015. ,
DOI : 10.1016/j.ejc.2015.02.031
An oriented version of the 1-2-3 Conjecture, Discussiones Mathematicae Graph Theory, pp.141-156, 2015. ,
DOI : 10.7151/dmgt.1791
URL : https://hal.archives-ouvertes.fr/hal-00849065
Decomposing oriented graphs into six locally irregular oriented graphs. To appear in Graphs and Combinatorics ,
Coloring chip configurations on graphs and digraphs, Information Processing Letters, vol.112, issue.1-2, pp.1-4, 2012. ,
DOI : 10.1016/j.ipl.2011.09.011
Vertex-coloring edge-weightings of graphs, Taiwanese Journal of Mathematics, vol.15, issue.4, pp.1807-1813, 2011. ,
A note on the 1,2-Conjecture, Electronic Journal of Combinatorics, 2015. ,
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.3, pp.347-349, 2010. ,
DOI : 10.1016/j.jctb.2009.06.002
A New Upper Bound for the Irregularity Strength of Graphs, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1319-1321, 2011. ,
DOI : 10.1137/090774112
Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.151-157, 2004. ,
DOI : 10.1016/j.jctb.2003.12.001
Digraphs are 2-weight choosable, Electronic Journal of Combinatorics, vol.18, issue.1, 2011. ,
On a 1,2 Conjecture, Discrete Mathematics and Theoretical Computer Science, vol.12, issue.1, pp.101-108, 2010. ,
The 1-2-3 Conjecture and related problems: a survey, 2012. ,