Combinatorial Nullstellensatz, Combinatorics, Probability and Computing, vol.8, issue.12, pp.7-29, 1995. ,
DOI : 10.1017/S0963548398003411
Weight choosability of graphs, Journal of Graph Theory, vol.85, issue.2, pp.242-256, 2009. ,
DOI : 10.1002/jgt.20354
A note on the 1,2-conjecture. Preprint, private communication, 2009. ,
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
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, ):Paper 21, 2011. ,
Vertexcolouring edge-weightings with two edge weights, Discrete Mathematics & Theoretical Computer Science, vol.14, issue.1, p.2012 ,
URL : https://hal.archives-ouvertes.fr/hal-00990567
On total weight choosability of graphs, Journal of Combinatorial Optimization, vol.66, issue.3, pp.766-783, 2013. ,
DOI : 10.1007/s10878-012-9491-x
On a 1,2 conjecture, Discrete Math. Theor. Comput. Sci, vol.12, issue.1, pp.101-108, 2010. ,
Total weight choosability of graphs, Electron. J. Combin, vol.18, issue.112 11, 2011. ,
Total weight choosability of cartesian product of graphs, European Journal of Combinatorics, vol.33, issue.8, pp.1725-1738, 2012. ,
List total weighting of graphs In Fete of combinatorics and computer science, Bolyai Soc. Math. Stud, vol.20, pp.337-353, 2010. ,
Every graph is (2,3)-choosable ,
Total weight choosability of graphs, J. Graph Theory, vol.66, issue.3, pp.198-212, 2011. ,