The neighbour-sum-distinguishing edge-colouring game
DOI10.1016/J.DISC.2017.02.019zbMATH Open1361.05040OpenAlexW2598195191MaRDI QIDQ526242FDOQ526242
Authors: Olivier Baudon, Jakub Przybyło, Mohammed Senhaji, Elżbieta Sidorowicz, Mariusz Woźniak, Éric 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
Recommendations
- Equitable neighbour-sum-distinguishing edge and total colourings
- The edge coloring game on trees with the number of colors greater than the game chromatic index
- On the total-neighbor-distinguishing index by sums
- Neighbor sum distinguishing index
- The neighbour sum distinguishing relaxed edge colouring
edge-weightingneighbour-sum-distinguishing edge-colouringneighbour-sum-distinguishing edge-colouring game
Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Combinatorial games (91A46)
Cites Work
- Edge weights and vertex colours
- General neighbour-distinguishing index of a graph
- On a \(1,2\) conjecture
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex colouring edge partitions
- 1,2 conjecture-the multiplicative version
- An oriented version of the 1-2-3 conjecture
- Coloring chip configurations on graphs and digraphs
- A new type of edge-derived vertex coloring
This page was built for publication: The neighbour-sum-distinguishing edge-colouring game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526242)
