12 citations · 16 across the 3 of their papers we have counts for
7 papers
Restricted optimal pebbling is NP-hard
László F. Papp
Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribut…
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…
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…
Optimal pebbling and rubbling of graphs with given diameter
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…
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…
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…
The Optimal Rubbling Number of Ladders, Prisms and Möbius-ladders
Gyula Y. Katona, László F. Papp
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…