Edge weights and vertex colours: minimizing sum count

DOI10.1016/j.dam.2019.07.019zbMath1426.05036OpenAlexW2883387158WikidataQ127393863 ScholiaQ127393863MaRDI QIDQ2334038

Hervé Hocquard, Julien Bensmail, Olivier Baudon, Mohammed Senhaji, Eric Sopena

Publication date: 6 November 2019

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

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

zbMATH Keywords

neighbour-sum-distinguishing edge-weightingsnumber of sums

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

On Proper Labellings of Graphs with Minimum Label Sum ⋮ An injective version of the 1-2-3 conjecture ⋮ On the role of 3's for the 1-2-3 conjecture ⋮ On minimizing the maximum color for the 1-2-3 conjecture ⋮ On the role of 3s for the 1--2--3 conjecture ⋮ Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs ⋮ On proper labellings of graphs with minimum label sum

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Algorithmic complexity of proper labeling problems
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• Hard tiling problems with simple tiles

This page was built for publication: Edge weights and vertex colours: minimizing sum count