Computing bounds on product graph pebbling numbers

DOI10.1016/j.tcs.2019.09.050zbMath1436.05074arXiv1905.08683MaRDI QIDQ2283021

Franklin H. J. Kenter, Dan Wilson, Daphne E. Skipper

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.08683

zbMATH Keywords

graph pebbling; Graham's conjecture; Lemke graph; partial pebbling

Mathematics Subject Classification ID

05C85: Graph algorithms (graph-theoretic aspects)

05C57: Games on graphs (graph-theoretic aspects)

05C76: Graph operations (line graphs, products, etc.)

Related Items

On properties of pebble assignment graphs, Cycles and girth in pebble assignment graphs

Cites Work

• Unnamed Item
• Graham's pebbling conjecture on product of thorn graphs of complete graphs
• An addition theorem on the integers modulo \(n\)
• Pebbling graphs
• The 2-pebbling property and a conjecture of Graham's
• The pebbling number of \(C_5\times C_5\)
• Graham's pebbling conjecture on product of complete bipartite graphs
• Pebbling and Graham's conjecture
• Integer-programming bounds on pebbling numbers of Cartesian-product graphs
• Lemke graphs and Graham's pebbling conjecture
• Modified linear programming and class 0 bounds for graph pebbling
• The weight function lemma for graph pebbling
• Graph pebbling algorithms and Lemke graphs
• Pebbling numbers of some graphs
• Pebbling in Hypercubes
• Pebbling on Graph Products and other Binary Graph Constructions
• Graham's pebbling conjecture on products of cycles
• The Complexity of Graph Pebbling