A proof of the multiplicative 1-2-3 conjecture

DOI10.1007/978-3-030-95018-7_1arXiv2108.10554MaRDI QIDQ6102259

Dimitri Lajou, Eric Sopena, Julien Bensmail, Hervé Hocquard

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

1-2-3 conjectureproduct versionlabels 1, 2, 3

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On a list variant of the multiplicative 1-2-3 conjecture

Cites Work

• 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
• Further evidence towards the multiplicative 1-2-3 conjecture
• The 1-2-3 conjecture almost holds for regular graphs
• Vertex colouring edge partitions

This page was built for publication: A proof of the multiplicative 1-2-3 conjecture