The neighbour-sum-distinguishing edge-colouring game
暂无分享,去创建一个
Éric Sopena | Jakub Przybylo | Elzbieta Sidorowicz | Mariusz Wozniak | Olivier Baudon | Mohammed Senhaji
[1] Florian Pfender,et al. Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture , 2010, J. Comb. Theory B.
[2] Jaroslaw Grytczuk,et al. Coloring chip configurations on graphs and digraphs , 2012, Inf. Process. Lett..
[3] Éric Sopena,et al. An Oriented Version of the 1-2-3 Conjecture , 2015, Discuss. Math. Graph Theory.
[4] Mirko Hornák,et al. General neighbour-distinguishing index of a graph , 2008, Discret. Math..
[5] Joanna Skowronek-Kaziów. 1, 2 Conjecture - the multiplicative version , 2008, Inf. Process. Lett..
[6] Ervin Györi,et al. A new type of edge-derived vertex coloring , 2009, Discret. Math..
[7] A. Thomason,et al. Edge weights and vertex colours , 2004 .
[8] Bruce A. Reed,et al. Vertex colouring edge partitions , 2005, J. Comb. Theory B.
[9] Jakub Przybylo,et al. On a 1, 2 Conjecture , 2010, Discret. Math. Theor. Comput. Sci..