The neighbour sum distinguishing relaxed edge colouring
From MaRDI portal
Publication:2668336
DOI10.1016/j.amc.2021.126864OpenAlexW4213340610MaRDI QIDQ2668336
Antoine Dailly, Aline Parreau, Elżbieta Sidorowicz, Eric Duchêne
Publication date: 3 March 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126864
Related Items (2)
Neighbour sum distinguishing edge-weightings with local constraints ⋮ On list \(r\)-hued coloring of outer-1-planar graphs
Cites Work
- Unnamed Item
- Neighbor sum distinguishing index
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Neighbor sum distinguishing edge coloring of subcubic graphs
- Vertex-coloring edge-weightings of graphs
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Edge weights and vertex colours
- Neighbor sum distinguishing index of subcubic graphs
- The 1-2-3 conjecture almost holds for regular graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- A New Upper Bound for the Irregularity Strength of Graphs
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- Combinatorial Nullstellensatz
This page was built for publication: The neighbour sum distinguishing relaxed edge colouring
