12 citations · 16 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
Optimal pebbling number of the square grid
Ervin Győri, Gyula Y. Katona, László F. Papp
A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a…
math.CO2018
Optimal pebbling number of graphs with given minimum degree
Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona +1
Consider a distribution of pebbles on a connected graph . A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a p…