A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs

DOI10.1016/J.DAM.2018.10.008zbMath1406.05042OpenAlexW2615471025WikidataQ122924356 ScholiaQ122924356MaRDI QIDQ1730218

Julien Bensmail

Publication date: 11 March 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.008

zbMATH Keywords

1-2-3 conjecture5-regular graphsfour weights

Mathematics Subject Classification ID

Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (5)

On the standard \((2,2)\)-conjecture ⋮ Neighbour sum distinguishing edge-weightings with local constraints ⋮ A solution to the 1-2-3 conjecture ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• On decomposing regular graphs into locally irregular subgraphs
• Vertex colouring edge partitions
• A relaxed case on 1-2-3 conjecture
• L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting

This page was built for publication: A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs