12 citations · 16 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
The Optimal Pebbling Number of Staircase Graphs
Ervin Győri, Gyula Y. Katona, László F. Papp +1
Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The…
math.CO2016★ 4 cited
Constructions for the optimal pebbling of grids
Ervin Győri, Gyula Y. Katona, László F. Papp
In [C. Xue, C. Yerger: Optimal Pebbling on Grids, Graphs and Combinatorics] the authors conjecture that if every vertex of an infinite square grid is reachable from a pebble distri…