A note on graph pebbling
From MaRDI portal
Publication:1606023
DOI10.1007/s003730200015zbMath1002.05038arXivmath/0406053OpenAlexW2028852147MaRDI QIDQ1606023
Andrzej Czygrinow, Henry A. Kierstead, Glenn H. Hurlbert, William T. jun. Trotter
Publication date: 29 July 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0406053
Related Items (8)
The weight function lemma for graph pebbling ⋮ General graph pebbling ⋮ Pebbling in powers of paths ⋮ Automating weight function generation in graph pebbling ⋮ The pebbling threshold of the square of cliques ⋮ Tiny zero-sum sequences over some special groups ⋮ Threshold and complexity results for the cover pebbling game ⋮ The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree
This page was built for publication: A note on graph pebbling
