79 citations · 203 across the 36 of their papers we have counts for
40 papers
On the pebbling numbers of Flower, Blanuša, and Watkins snarks
Matheus Adauto, Celina de Figueiredo, Glenn Hurlbert +1
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 pebbl…
Cops and robbers pebbling in graphs
Nancy Clarke, Joshua Forkin, Glenn Hurlbert
Here we merge the two fields of Cops and Robbers and Graph Pebbling to introduce the new topic of Cops and Robbers Pebbling. Both paradigms can be described by moving tokens (the c…
On the Secure Vertex Cover Pebbling Number
Glenn H Hurlbert, Lian Mathew, Jasintha Quadras +1
A new graph invariant called the secure vertex cover pebbling number, which is a combination of two graph invariants, namely secure vertex cover and cover pebbling number, is intro…
On the Holroyd-Talbot Conjecture for Sparse Graphs
Peter Frankl, Glenn Hurlbert
Given a graph , let denote the size of the smallest maximal independent set in . A family of subsets is called a star if some element is in every set of the family. A…
Pebbling in Powers of Paths
Liliana Alcón, Glenn Hurlbert
The -fold pebbling number, , of a graph is defined to be the minimum number so that, from any given configuration of pebbles on the vertices of , it is po…
On the Target Pebbling Conjecture
Glenn Hurlbert, Essak Seddiq
Graph pebbling is a network optimization model for satisfying vertex demands with vertex supplies (called pebbles), with partial loss of pebbles in transit. The pebbling number of…