A Proof of the Multiplicative 1-2-3 Conjecture

Julien Bensmail,Hervé Hocquard,Dimitri Lajou,Éric Sopena

Lecture Notes in Computer Science（2022）

引用 0|浏览0

暂无评分

摘要

We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kaziów in 2012, is true. Namely, for every connected graph with order at least 3, we can assign labels 1, 2, 3 to the edges so that no two adjacent vertices are incident to the same product of labels.

查看译文

关键词

conjecture,multiplicative,proof

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要