most citedA Survey of Graph Pebbling

79 citations · 164 across the 10 of their papers we have counts for

collaborators
Showing math.COShow all

10 papers · 1 filter

math.CO200547 cited

Recent Progress in Graph Pebbling

Glenn Hurlbert

The subject of graph pebbling has seen dramatic growth recently, both in the number of publications and in the breadth of variations and applications. Here we update the reader on…

math.CO200428 cited

An application of graph pebbling to zero-sum sequences in abelian groups

Shawn Elldge, Glenn H. Hurlbert

A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important app…

math.CO200410 cited

Cover Pebbling Hypercubes

Glenn H. Hurlbert, Benjamin Munyan

Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step removes two pebbles from one vertex and places one pebble on an adjacent vertex. The cover pe…

math.CO2004

The Cover Pebbling Number of Graphs

Betsy Crull, Tammy Cundiff, Paul Feltman +4

A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a spec…

math.CO2004

Girth, Pebbling, and Grid Thresholds

Andrzej Czygrinow, Glenn Hurlbert

In this note we answer a question of Hurlbert about pebbling in graphs of high girth. Specifically we show that for every g there is a Class 0 graph of girth at least g. The proof…

math.CO2004

On the Pebbling Threshold Spectrum

Andrzej Czygrinow, Glenn Hurlbert

A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling thre…