The neighbour-sum-distinguishing edge-colouring game

DOI10.1016/j.disc.2017.02.019zbMath1361.05040OpenAlexW2598195191MaRDI QIDQ526242

Mariusz Woźniak, Olivier Baudon, Mohammed Senhaji, Jakub Przybyło, Elżbieta Sidorowicz, Eric Sopena

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.02.019

zbMATH Keywords

edge-weightingneighbour-sum-distinguishing edge-colouringneighbour-sum-distinguishing edge-colouring game

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial games (91A46) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Coloring chip configurations on graphs and digraphs
• 1,2 conjecture-the multiplicative version
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• A new type of edge-derived vertex coloring
• Edge weights and vertex colours
• An oriented version of the 1-2-3 conjecture
• General neighbour-distinguishing index of a graph
• Vertex colouring edge partitions

This page was built for publication: The neighbour-sum-distinguishing edge-colouring game