Recent Progress in Graph Pebbling
arXiv:math/0509339
Abstract
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 the many developments that have occurred since the original Survey of Graph Pebbling in 1999.
24 pages, 1 figure
References in corpus (12)
- A Survey of Graph Pebbling
- An application of graph pebbling to zero-sum sequences in abelian groups
- Conditions for Weighted Cover Pebbling of Graphs
- Cover pebbling numbers and bounds for certain families of graphs
- Domination Cover Pebbling: Graph Families
- The Complexity of Pebbling and Cover Pebbling
- Cover Pebbling Hypercubes
- Optimal pebbling of paths and cycles
- Improved Pebbling Bounds
- Cover pebbling cycles and certain graph products
- The Complexity of Graph Pebbling
- The cover pebbling theorem
Cited by in corpus (12)
- Token Graphs
- The Optimal Rubbling Number of Ladders, Prisms and Möbius-ladders
- A linear optimization technique for graph pebbling
- On a combinatorial problem of Erdos, Kleitman and Lemke
- Weighted pebbling numbers on graphs
- On an inverse problem of Erd\H os, Kleitman, and Lemke
- On the Assignment Graphs of Oriented Graphs
- Counterexamples to a Monotonicity Conjecture for the Threshold Pebbling Number
- Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs
- Generalization of the cover pebbling number on trees
- On Pebbling Graphs by their Blocks
- Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains