A Graph Pebbling Algorithm on Weighted Graphs
From MaRDI portal
Publication:3075605
DOI10.7155/jgaa.00205zbMath1213.05253arXiv0904.1651OpenAlexW2136116874MaRDI QIDQ3075605
Publication date: 16 February 2011
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.1651
Related Items (9)
On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity ⋮ Bounds on the rubbling and optimal rubbling numbers of graphs ⋮ The weight function lemma for graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Cycles and girth in pebble assignment graphs ⋮ Automating weight function generation in graph pebbling ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Unnamed Item ⋮ On properties of pebble assignment graphs
This page was built for publication: A Graph Pebbling Algorithm on Weighted Graphs
