13 citations · 45 across the 24 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
math.CO2007
Rubbling and Optimal Rubbling of Graphs
Christopher Belford, Nandor Sieben
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this…
math.CO2007
Avoidable Sets in The Bicyclic Inverse Semigroup
Nandor Sieben
A subset of a set with a binary operation is called {\it avoidable} if can be partitioned into two subsets and such that no element of can be written as a p…