Maximum pebbling number of graphs of diameter three
From MaRDI portal
Publication:5486284
DOI10.1002/JGT.20187zbMATH Open1099.05076OpenAlexW4255444748MaRDI QIDQ5486284FDOQ5486284
Authors: Boris Bukh
Publication date: 6 September 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20187
Recommendations
Cited In (22)
- Pebbling graphs of fixed diameter
- The pebbling threshold of the square of cliques
- On properties of pebble assignment graphs
- A note on graph pebbling
- Pebbling number of Bi-wheel: a diameter three class 0 graph.
- Critical pebbling numbers of graphs
- Modified linear programming and class 0 bounds for graph pebbling
- Pebbling graphs of diameter three and four
- On Pebbling Graphs by Their Blocks
- \(t\)-pebbling and extensions
- Optimal pebbling of graphs
- Improved pebbling bounds
- Equality of pebbling numbers on directed graphs
- Threshold and complexity results for the cover pebbling game
- Automating weight function generation in graph pebbling
- Distance pebbling on directed cycle graphs
- Bounds on the rubbling and optimal rubbling numbers of graphs
- Bounds on the rubbling and optimal rubbling numbers of graphs
- The complexity of pebbling in diameter two graphs
- Pebbling graphs of diameter three and four
- The t-pebbling number of Jahangir graph J3,m
- General graph pebbling
This page was built for publication: Maximum pebbling number of graphs of diameter three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486284)