[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 …
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 in split graphs
Graph pebbling is a network optimization model for transporting discrete resources that are
consumed in transit: the movement of 2 pebbles across an edge consumes one of the …
consumed in transit: the movement of 2 pebbles across an edge consumes one of 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 …
Critical pebbling numbers of graphs
We define three new pebbling parameters of a connected graph $ G $, the $ r $-, $ g $-, and
$ u $-critical pebbling numbers. Together with the pebbling number, the optimal pebbling …
$ u $-critical pebbling numbers. Together with the pebbling number, the optimal pebbling …
a Comprehensive Review on Graph Pebbling and Rubbling
S Sreedevi, MS Anilkumar - Journal of Physics: Conference …, 2020 - iopscience.iop.org
A graph pebbling is a combinatorial game played over a fixed graph and a pebbling move is
the method of removing two pebbles from one endpoint and sets one pebble at the other …
the method of removing two pebbles from one endpoint and sets one pebble at the other …
[PDF][PDF] Pebbling in 2-Paths
LAM Gutierreza, G Hurlbertb - glennhurlbert.github.io
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 …