\(t\)-pebbling and extensions

DOI10.1007/s00373-012-1152-4zbMath1268.05129arXiv0905.3949OpenAlexW2133314113MaRDI QIDQ354409

David Samuel Herscovici, Glenn H. Hurlbert, Benjamin D. Hester

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmupper boundpebbling numberdiameter-two graphfractional pebblinggraph pebblinginitial distributionoptimal pebblingpebbling movestarget distribution

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (11)

Optimal pebbling on grids ⋮ Pebbling in 2-paths ⋮ Optimal pebbling number of the square grid ⋮ The weight function lemma for graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Optimal t-rubbling on complete graphs and paths ⋮ Pebbling in powers of paths ⋮ On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Pebbling in semi-2-trees ⋮ Pebbling on Graph Products and other Binary Graph Constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimally pebbling hypercubes and powers
• The weight function lemma for graph pebbling
• Pebbling Graphs of Diameter Three and Four
• On Pebbling Graphs by Their Blocks
• Pebbling in Hypercubes
• Pebbling Algorithms in Diameter Two Graphs
• Pebbling in diameter two graphs and products of paths
• Graham's pebbling conjecture on products of cycles
• Pebbling and optimal pebbling in graphs
• Maximum pebbling number of graphs of diameter three

This page was built for publication: \(t\)-pebbling and extensions