Recommendations
- On a 1,2 conjecture
- A proof of the multiplicative 1-2-3 conjecture
- Further evidence towards the multiplicative 1-2-3 conjecture
- The 1,2-conjecture for powers of cycles
- On the 1-2-3-conjecture
- On a total version of 1-2-3 conjecture
- On a multiplicative version of Bloch's conjecture
- On the multiplicity conjecture
- On a list variant of the multiplicative 1-2-3 conjecture
- Multiplicity conjectures
Cites work
Cited in
(16)- A note on edge weightings inducing proper vertex colorings
- Further evidence towards the multiplicative 1-2-3 conjecture
- Neighbour-distinguishing labellings of powers of paths and powers of cycles
- An oriented version of the 1-2-3 conjecture
- Neighbor product distinguishing total colorings of 2-degenerate graphs
- The 1,2-conjecture for powers of cycles
- On a 1,2 conjecture
- Algorithmic complexity of proper labeling problems
- Computation of lucky number of planar graphs is NP-hard
- Multiplicative vertex-colouring weightings of graphs
- Neighbor product distinguishing total colorings
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- The neighbour-sum-distinguishing edge-colouring game
- A proof of the multiplicative 1-2-3 conjecture
- Total vertex product irregularity strength of graphs
- Lucky labelings of graphs
This page was built for publication: 1,2 conjecture-the multiplicative version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963408)
