The 1-2-3 Conjecture holds for graphs with large enough minimum degree
From MaRDI portal
Publication:6337627
arXiv2003.13139MaRDI QIDQ6337627
Publication date: 29 March 2020
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
This page was built for publication: The 1-2-3 Conjecture holds for graphs with large enough minimum degree