Further evidence towards the multiplicative 1-2-3 conjecture
From MaRDI portal
Publication:2057599
DOI10.1016/j.dam.2021.10.014zbMath1479.05315arXiv2004.09090OpenAlexW3203914829WikidataQ113877216 ScholiaQ113877216MaRDI QIDQ2057599
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Eric Sopena
Publication date: 7 December 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.09090
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Related Items (2)
On a list variant of the multiplicative 1-2-3 conjecture ⋮ A proof of the multiplicative 1-2-3 conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Multiplicative vertex-colouring weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- A dynamic survey of graph labeling
- Multi-set neighbor distinguishing 3-edge coloring
- Edge weights and vertex colours
- The 1-2-3 conjecture almost holds for regular graphs
- Vertex-coloring 3-edge-weighting of some graphs
- Vertex colouring edge partitions
- A relaxed case on 1-2-3 conjecture
- On neighbour sum-distinguishing $\{0,1\}$-edge-weightings of bipartite graphs
This page was built for publication: Further evidence towards the multiplicative 1-2-3 conjecture