1,2 conjecture-the multiplicative version
From MaRDI portal
Publication:963408
DOI10.1016/J.IPL.2008.01.006zbMATH Open1185.05066OpenAlexW2072075198WikidataQ123095352 ScholiaQ123095352MaRDI QIDQ963408FDOQ963408
Authors: Joanna Skowronek-Kaziów 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.006
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 (15)
- Multiplicative vertex-colouring weightings of graphs
- A note on edge weightings inducing proper vertex colorings
- Lucky labelings of graphs
- Further evidence towards the multiplicative 1-2-3 conjecture
- An oriented version of the 1-2-3 conjecture
- On a \(1,2\) conjecture
- A proof of the multiplicative 1-2-3 conjecture
- The 1,2-conjecture for powers of cycles
- Algorithmic complexity of proper labeling problems
- Computation of lucky number of planar graphs is NP-hard
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Neighbour-distinguishing labellings of powers of paths and powers of cycles
- Neighbor product distinguishing total colorings of 2-degenerate graphs
- Neighbor product distinguishing total colorings
- The neighbour-sum-distinguishing edge-colouring game
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)
