16 citations · 53 across the 13 of their papers we have counts for
Showing 2016 · math.COShow all
3 papers · 2 filters
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★ 16 cited
Properties of minimally -tough graphs
Gyula Y. Katona, Dániel Soltész, Kitti Varga
A graph is minimally -tough if the toughness of is and the deletion of any edge from decreases the toughness. Kriesell conjectured that for every minimally -t…
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…