Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture

DOI10.1016/j.dam.2018.05.047zbMath1401.05135OpenAlexW2734396578WikidataQ123346470 ScholiaQ123346470MaRDI QIDQ1627846

Mohammed Senhaji, Julien Bensmail, Olivier Baudon, Eric Sopena

Publication date: 3 December 2018

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

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

zbMATH Keywords

bipartite graphs1-2-3 conjecturedifference-2 distinction

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22)

Related Items (1)

Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs

Cites Work

• 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
• Bounding the weight choosability number of a graph
• Minimum-weight triangulation is NP-hard
• Paths, Trees, and Flowers

This page was built for publication: Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture