[PDF][PDF] Graph pebbling
G Hurlbert - Handbook of graph theory, 2013 - glennhurlbert.github.io
The graph pebbling model we study here was born as a method for solving a combinatorial
number theory conjecture of Erdős and Lemke and has since been applied to problems in …
number theory conjecture of Erdős and Lemke and has since been applied to problems in …
Pebbling in powers of paths
L Alcón, G Hurlbert - Discrete Mathematics, 2023 - Elsevier
The t-fold pebbling number, π t (G), of a graph G is defined to be the minimum number m so
that, from any given configuration of m pebbles on the vertices of G, it is possible to place at …
that, from any given configuration of m pebbles on the vertices of G, it is possible to place at …
The weight function lemma for graph pebbling
G Hurlbert - Journal of Combinatorial Optimization, 2017 - Springer
Graph pebbling is a network model for studying whether or not a given supply of discrete
pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge …
pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge …
Pebbling on graph products and other binary graph constructions
Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from
one vertex to another by removing another pebble from the first vertex. The pebbling number …
one vertex to another by removing another pebble from the first vertex. The pebbling number …
Pebbling in Kneser graphs
M Adauto, V Bardenova, M da Cruz… - Latin American …, 2024 - Springer
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move
removes two pebbles from one vertex and places one pebble on an adjacent vertex. The …
removes two pebbles from one vertex and places one pebble on an adjacent vertex. The …
[HTML][HTML] Pebbling in semi-2-trees
Graph pebbling is a network model for transporting discrete resources that are consumed in
transit. Deciding whether a given configuration on a particular graph can reach a specified …
transit. Deciding whether a given configuration on a particular graph can reach a specified …
Pebbling in 2-paths
Graph pebbling is a network model for transporting discrete resources that are consumed in
transit. Deciding whether a given configuration on a particular graph can reach a specified …
transit. Deciding whether a given configuration on a particular graph can reach a specified …
[HTML][HTML] The complexity of pebbling reachability and solvability in planar and outerplanar graphs
T Lewis, CA Cusack, L Dion - Discrete Applied Mathematics, 2014 - Elsevier
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to
the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles …
the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles …
[HTML][HTML] Graph pebbling algorithms and Lemke graphs
CA Cusack, A Green, A Bekmetjev, M Powers - Discrete Applied …, 2019 - Elsevier
Given a simple, connected graph, a pebbling configuration (or just configuration) is a
function from its vertex set to the nonnegative integers. A pebbling move between adjacent …
function from its vertex set to the nonnegative integers. A pebbling move between adjacent …
On the pebbling numbers of Flower, Blanuša and Watkins snarks
M Adauto, C de Figueiredo, G Hurlbert… - Discrete Applied …, 2025 - Elsevier
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move
removes two pebbles from one vertex and places one pebble on an adjacent vertex. The …
removes two pebbles from one vertex and places one pebble on an adjacent vertex. The …