Further results on an equitable 1-2-3 conjecture
From MaRDI portal
Publication:2022502
Recommendations
- On the 1-2-3-conjecture
- On a total version of 1-2-3 conjecture
- Further evidence towards the multiplicative 1-2-3 conjecture
- Results on the \(3x+1\) and \(3x+d\) conjectures
- On the (3N+1)-conjecture
- On the \(1/3-2/3\) conjecture
- The 3n+1-conjecture
- A proof of the multiplicative 1-2-3 conjecture
- On the role of 3's for the 1-2-3 conjecture
- A Solution to the 2/3 Conjecture
Cites work
- Edge weights and vertex colours
- Equitable neighbour-sum-distinguishing edge and total colourings
- Minimum-weight triangulation is NP-hard
- On a 1,2 conjecture
- On minimizing the maximum color for the 1-2-3 conjecture
- On Proper Labellings of Graphs with Minimum Label Sum
- 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: towards the 1-2-3-conjecture
Cited in
(7)- On the role of 3s for the 1-2-3 conjecture
- scientific article; zbMATH DE number 2028649 (Why is no real title available?)
- A notion of vertex equitability for proper labellings
- An improved bound for equitable proper labellings
- Maximising 1's through proper labellings
- On proper 2-labellings distinguishing by sums, multisets or products
- An improved bound for equitable proper labellings
This page was built for publication: Further results on an equitable 1-2-3 conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022502)