On the 1-2-3-conjecture

zbMath1310.05088arXiv1205.3266MaRDI QIDQ5249227

Behnaz Omoomi, Akbar Davoodi

Publication date: 30 April 2015

Full work available at URL: https://arxiv.org/abs/1205.3266

zbMATH Keywords

1-2-3-conjecturevertex-coloring edge-weightingedge weightingvertex-coloring 2-edge-weighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Neighbour-distinguishing labellings of families of graphs, Graphs with vertex-coloring and detectable 2-edge-weighting, Neighbour-distinguishing labellings of powers of paths and powers of cycles, On the total versions of 1-2-3-conjecture for graphs and hypergraphs, On a total version of 1-2-3 conjecture, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)