Maximum pebbling number of graphs of diameter three

DOI10.1002/JGT.20187MaRDI QIDQ5486284zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Pebbling graphs of diameter three and four
• Pebbling graphs of diameter three and four
• Optimal pebbling of graphs
• Pebbling graphs of fixed diameter
• The complexity of pebbling in diameter two graphs

Cited in

(23)

• Threshold and complexity results for the cover pebbling game
• A note on graph pebbling
• On properties of pebble assignment graphs
• Bounds on the rubbling and optimal rubbling numbers of graphs
• Modified linear programming and class 0 bounds for graph pebbling
• Improved pebbling bounds
• Optimal pebbling of graphs
• Pebbling graphs of diameter three and four
• Bounds on the rubbling and optimal rubbling numbers of graphs
• Pebbling number of Bi-wheel: a diameter three class 0 graph.
• Critical pebbling numbers of graphs
• Equality of pebbling numbers on directed graphs
• On Pebbling Graphs by Their Blocks
• The t-pebbling number of Jahangir graph J3,m
• t-pebbling and extensions
• General graph pebbling
• The complexity of pebbling in diameter two graphs
• Pebbling graphs of diameter three and four
• Distance pebbling on directed cycle graphs
• Pebbling graphs of fixed diameter
• Automating weight function generation in graph pebbling
• Rubbling and optimal rubbling of dense bipartite graphs
• The pebbling threshold of the square of cliques

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)