1 citations · 1 across the 2 of their papers we have counts for
2 papers
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.CO2010★ 1 cited
Uncoverings on graphs and network reliability
Robert F. Bailey, Brett Stevens
We propose a network protocol similar to the -tree protocol of Itai and Rodeh [{\em Inform.\ and Comput.}\ {\bf 79} (1988), 43--59]. To do this, we define an {\em -uncovering…