1,2 conjecture-the multiplicative version
From MaRDI portal
Publication:963408
DOI10.1016/j.ipl.2008.01.006zbMath1185.05066OpenAlexW2072075198WikidataQ123095352 ScholiaQ123095352MaRDI QIDQ963408
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
Related Items
The 1,2-conjecture for powers of cycles, Neighbour-distinguishing labellings of powers of paths and powers of cycles, 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 note on edge weightings inducing proper vertex colorings, An oriented version of the 1-2-3 conjecture, Lucky labelings of graphs, Neighbor product distinguishing total colorings of 2-degenerate graphs
Cites Work