Cover Pebbling Thresholds for the Complete Graph. - Anant P. Godbole; Nathaniel G. Watson; Carl R. Yerger (Electron. Notes Discret. Math., 2005)

Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

Threshold and complexity results for the cover pebbling game. - Anant P. Godbole; Nathaniel G. Watson; Carl R. Yerger (Discret. Math., 2009)

Color-critical graphs on surfaces. - Carl Yerger (2010)

Five-coloring graphs on the Klein bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger (J. Comb. Theory B, 2012)

Pebbling Graphs of Diameter Three and Four. - Luke Postle; Noah Streib; Carl Yerger (J. Graph Theory, 2013)

On three sets with nondecreasing diameter. - Daniel Irving Bernstein; David J. Grynkiewicz; Carl Yerger (Discret. Math., 2015)

Optimal Pebbling on Grids. - Chenxiao Xue; Carl Yerger (Graphs Comb., 2016)

Modified linear programming and class 0 bounds for graph pebbling. - Daniel W. Cranston; Luke Postle; Chenxiao Xue; Carl Yerger (J. Comb. Optim., 2017)

Planar graphs with girth 20 are additively 3-choosable. - Axel Brandt; Nathan Tenpas; Carl R. Yerger (Discret. Appl. Math., 2020)

Automating weight function generation in graph pebbling. - Dominic Flocco; Jonad Pulaj; Carl Yerger (Discret. Appl. Math., 2024)

Lollipop and cubic weight functions for graph pebbling. - Marshall Yang; Carl Yerger; Runtian Zhou (J. Comb. Optim., 2025)