Equitable neighbour-sum-distinguishing edge and total colourings

DOI10.1016/j.dam.2017.01.031zbMath1396.05037arXiv1701.04648OpenAlexW2412010298MaRDI QIDQ1786869

Monika Pilśniak, Olivier Baudon, Mohammed Senhaji, Mariusz Woźniak, Jakub Przybyło, Eric Sopena

Publication date: 25 September 2018

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

Full work available at URL: https://arxiv.org/abs/1701.04648

zbMATH Keywords

equitable colouringneighbour-sum-distinguishing edge colouringneighbour-sum-distinguishing total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On Proper Labellings of Graphs with Minimum Label Sum ⋮ A notion of vertex equitability for proper labellings ⋮ On the role of 3s for the 1--2--3 conjecture ⋮ Further results on an equitable 1-2-3 conjecture ⋮ On proper labellings of graphs with minimum label sum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex-coloring 2-edge-weighting of graphs
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Handbook of Combinatorial Optimization