The 1-2-3 Conjecture and related problems: a survey
From MaRDI portal
Publication:6237375
arXiv1211.5122MaRDI QIDQ6237375FDOQ6237375
Authors: Ben Seamone 
Publication date: 21 November 2012
Abstract: The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any adjacent vertices u and v, the sum of weights of edges incident to u differs from the sum of weights of edges incident to v." This survey paper presents the current state of research on the 1-2-3 Conjecture and the many variants that have been proposed in its short but active history.
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Research exposition (monographs, survey articles) pertaining to history and biography (01-02)
This page was built for publication: The 1-2-3 Conjecture and related problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237375)
