collaborators

1 paper

math.CO2004

A Note on Graph Pebbling

Andrzej Czygrinow, Glenn Hurlbert, Hal Kierstead +1

We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that eve…