Graph pebbling, as introduced by Chung, is a two-player game on a graph G. Player one
distributes “pebbles” to vertices and designates a root vertex. Player two attempts to move a …

Given a distribution of pebbles to the vertices of a graph, a pebbling move removes two
pebbles from a single vertex and places a single pebble on an adjacent vertex. The …

Graph pebbling is a combinatorial game played on an undirected graph with an initial
configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex …

Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling
move consists of removing two pebbles from one vertex and placing one pebble on an …

Let G be a connected graph. A configuration of pebbles on G is a function that assigns a
nonnegative integer to each vertex. A pebbling move consists of removing two pebbles from …

Let G be a connected graph. A configuration of pebbles assigns a nonnegative integer
number of pebbles to each vertex of G. A move consists of removing two pebbles from one …