Edge weights and vertex colours: minimizing sum count
From MaRDI portal
Recommendations
- Neighbour sum distinguishing edge-weightings with local constraints
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture
- scientific article; zbMATH DE number 6613818
- Vertex coloring edge weightings with integer weights at most 6
- The neighbour sum distinguishing relaxed edge colouring
Cites work
- Algorithmic complexity of proper labeling problems
- Edge weights and vertex colours
- Hard tiling problems with simple tiles
- On a 1,2 conjecture
- On the complexity of vertex-coloring edge-weightings
- The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
Cited in
(14)- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture
- Edge weights and vertex colours
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
- On proper labellings of graphs with minimum label sum
- On minimizing the maximum color for the 1-2-3 conjecture
- On the role of 3s for the 1-2-3 conjecture
- An injective version of the 1-2-3 conjecture
- On the role of 3's for the 1-2-3 conjecture
- On neighbour sum-distinguishing \(\{0,1\}\)-edge-weightings of bipartite graphs
- On Proper Labellings of Graphs with Minimum Label Sum
- Neighbour sum distinguishing edge-weightings with local constraints
- Adding direction constraints to the 1-2-3 conjecture
- On a graph labelling conjecture involving coloured labels
- Some remarks and results on the standard (2,2)-conjecture
This page was built for publication: Edge weights and vertex colours: minimizing sum count
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334038)
