Pebbling and optimal pebbling in graphs
From MaRDI portal
Publication:5450348
DOI10.1002/jgt.20278zbMath1142.05046arXivmath/0510621OpenAlexW2951661818MaRDI QIDQ5450348
Douglas B. West, Daniel W. Cranston, Kevin G. Milans, David P. Bunde, Erin Wolf Chambers
Publication date: 20 March 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0510621
Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Paths and cycles (05C38) Distance in graphs (05C12)
Related Items (23)
Optimal pebbling on grids ⋮ The optimal rubbling number of ladders, prisms and Möbius-ladders ⋮ Bounds on the rubbling and optimal rubbling numbers of graphs ⋮ Optimal pebbling of graphs ⋮ Doppelgangers and Lemke graphs ⋮ \(t\)-pebbling and extensions ⋮ Optimal pebbling number of the square grid ⋮ General graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Optimal t-rubbling on complete graphs and paths ⋮ Strict optimal rubbling of graphs ⋮ The optimal pebbling number of staircase graphs ⋮ Pebbling in powers of paths ⋮ Optimal pebbling number of graphs with given minimum degree ⋮ Restricted optimal pebbling and domination in graphs ⋮ Pebbling in semi-2-trees ⋮ The proof of a conjecture due to Snevily ⋮ Unnamed Item ⋮ Optimal pebbling and rubbling of graphs with given diameter ⋮ Rubbling and optimal rubbling of graphs ⋮ The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree ⋮ A new lower bound on the optimal pebbling number of the grid ⋮ The optimal pebbling of spindle graphs
This page was built for publication: Pebbling and optimal pebbling in graphs
