8 citations · 12 across the 2 of their papers we have counts for
2 papers
math.CO2005★ 8 cited
Optimal pebbling of paths and cycles
T. Friedman, C. Wyels
Distributions of pebbles to the vertices of a graph are said to be solvable when a pebble may be moved to any specified vertex using a sequence of admissible pebbling rules. The op…
math.CO2004★ 4 cited
Cover pebbling cycles and certain graph products
Maggy Tomova, Cindy Wyels
A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a…