The cover pebbling number of graphs

DOI10.1016/j.disc.2005.03.009zbMath1066.05140arXivmath/0406206OpenAlexW2120327434WikidataQ30053617 ScholiaQ30053617MaRDI QIDQ2484366

Zsuzsanna Szaniszló, Lara K. Pudwell, Zsolt Tuza, Tammy Cundiff, Paul Feltman, Betsy Crull, Glenn H. Hurlbert

Publication date: 1 August 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0406206

zbMATH Keywords

Coverable

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (14)

SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS ⋮ Optimal pebbling number of the square grid ⋮ General graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Total domination cover rubbling ⋮ Maximal matching cover pebbling number for variants of hypercube ⋮ Cover rubbling and stacking ⋮ Pebbling in powers of paths ⋮ Generalizations of Graham's pebbling conjecture ⋮ The pebbling threshold of the square of cliques ⋮ Domination cover rubbling ⋮ Threshold and complexity results for the cover pebbling game ⋮ Rubbling and optimal rubbling of graphs ⋮ Cover Pebbling Thresholds for the Complete Graph

Cites Work

• Pebbling graphs
• The cover pebbling theorem
• Pebbling in Hypercubes
• Graham's pebbling conjecture on products of cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The cover pebbling number of graphs