Further evidence towards the multiplicative 1-2-3 conjecture

DOI10.1016/J.DAM.2021.10.014MaRDI QIDQ2057599zbMATH OpenOpenAlexWikidataFDO

Authors Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric 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

zbMATH Keywords

1-2-3 conjecture4-chromatic graphsmultiset versionproduct version

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of labels. To date, this conjecture was mainly verified for complete graphs and 3-colourable graphs. As a strong support to the conjecture, it was also proved that all graphs admit such 4-labellings. In this work, we investigate how a recent proof of the multiset version of the 1-2-3 Conjecture by Vu{v c}kovi{'c} can be adapted to prove results on the product version. We prove that 4-chromatic graphs verify the product version of the 1-2-3 Conjecture. We also prove that for all graphs we can design 3-labellings that almost have the desired property. This leads to a new problem, that we solve for some graph classes.

Recommendations

• On a list variant of the multiplicative 1-2-3 conjecture
• 1,2 conjecture-the multiplicative version
• On the role of 3s for the 1-2-3 conjecture
• Multiplicative vertex-colouring weightings of graphs
• An injective version of the 1-2-3 conjecture

Cites work

• A dynamic survey of graph labeling
• A general decomposition theory for the 1-2-3 conjecture and locally irregular decompositions
• A relaxed case on 1-2-3 conjecture
• Edge weights and vertex colours
• Multi-set neighbor distinguishing 3-edge coloring
• Multiplicative vertex-colouring weightings of graphs
• On a \(1,2\) conjecture
• On neighbour sum-distinguishing \(\{0,1\}\)-edge-weightings of bipartite graphs
• The 1-2-3 conjecture almost holds for regular graphs
• Vertex colouring edge partitions
• Vertex-coloring 3-edge-weighting of some graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture

Cited in

(7)

• A proof of the multiplicative 1-2-3 conjecture
• 1,2 conjecture-the multiplicative version
• Further results on an equitable 1-2-3 conjecture
• A proof of the multiplicative 1-2-3 conjecture
• A Non-Iterative 2-Adic Statement of the 3N + 1 Conjecture
• On a list variant of the multiplicative 1-2-3 conjecture
• scientific article; zbMATH DE number 5885063 (Why is no real title available?)

This page was built for publication: Further evidence towards the multiplicative 1-2-3 conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057599)