  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 pebbling number $\pi(G)$ is the smallest $t$ so that from
any initial configuration of $t$ pebbles it is possible, after a sequence of
pebbling moves, to place a pebble on any given target vertex. In this paper, we
provide the first results on the pebbling numbers of snarks. Until now, only
the Petersen graph had its pebbling number correctly established, although
attempts had been made for the Flower and Watkins snarks.
