78 citations · 108 across the 14 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 78 cited
The 1-2-3 Conjecture and related problems: a survey
Ben Seamone
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 ma…
math.CO2012
Sequence variations of the 1-2-3 Conjecture and irregularity strength
Ben Seamone, Brett Stevens
Karonski, Luczak, and Thomason (2004) conjectured that, for any connected graph G on at least three vertices, there exists an edge weighting from {1,2,3} such that adjacent vertice…
math.CO2012★ 1 cited
Bounding the weight choosability number of a graph
Ben Seamone
Let be a graph, and for each , let be a list of real numbers. Let be an edge weighting function such that $w(e) \in…