The 1‐2‐3‐conjecture holds for dense graphs

DOI10.1002/jgt.22413zbMath1416.05163OpenAlexW2895265941WikidataQ123164996 ScholiaQ123164996MaRDI QIDQ4632023

Liang Zhong

Publication date: 25 April 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22413

zbMATH Keywords

edge-decomposition1-2-3-conjecturedense graphsedge-weighting

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Density (toughness, etc.) (05C42)

Related Items (4)

A note on 1-2-3 conjecture for Halin graphs ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ A solution to the 1-2-3 conjecture ⋮ The 1-2-3 conjecture almost holds for regular graphs

This page was built for publication: The 1‐2‐3‐conjecture holds for dense graphs