-
Carl R. Yerger, Solving Problems in Graph Pebbling using Optimization and Structural Techniques
Carl R. Yerger, Solving Problems in Graph Pebbling using Optimization and Structural Techniques
Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebbling on an adjacent vertex. The pebbling number of a graph is the smallest number of pebbles necessary such that, given any initial configuration …