The weight function lemma for graph pebbling

DOI10.1007/S10878-016-9993-ZzbMath1383.90042arXiv1101.5641OpenAlexW2338527282WikidataQ124834002 ScholiaQ124834002MaRDI QIDQ2410088

Glenn H. Hurlbert

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

class 0pebbling numberGraham's conjecturepebbling exponentpebbling strategy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (11)

Lemke graphs and Graham's pebbling conjecture ⋮ A note on pebbling bound for a product of Class 0 graphs ⋮ Doppelgangers and Lemke graphs ⋮ \(t\)-pebbling and extensions ⋮ General graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Pebbling in powers of paths ⋮ Pebbling on zig-zag chain graph of n odd cycles ⋮ Computing bounds on product graph pebbling numbers ⋮ Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph ⋮ Pebbling on Graph Products and other Binary Graph Constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pebbling in 2-paths
• \(t\)-pebbling and extensions
• General graph pebbling
• Pebbling in semi-2-trees
• On the pebbling threshold of paths and the pebbling threshold spectrum
• The pebbling threshold of the square of cliques
• Minimum size of a graph or digraph of given radius
• Graham's pebbling conjecture on products of many cycles
• Cubic Ramanujan graphs
• Thresholds for families of multisets, with an application to graph pebbling
• On pebbling threshold functions for graph sequences
• A note on graph pebbling
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• Pebbling in Split Graphs
• A Graph Pebbling Algorithm on Weighted Graphs
• Pebbling in Hypercubes
• Pebbling Algorithms in Diameter Two Graphs
• Pebbling in diameter two graphs and products of paths
• The Complexity of Pebbling in Diameter Two Graphs
• Girth, Pebbling, and Grid Thresholds
• The Complexity of Graph Pebbling

This page was built for publication: The weight function lemma for graph pebbling