Article ID Journal Published Year Pages File Type
419725 Discrete Applied Mathematics 2013 11 Pages PDF
Abstract

Graph pebbling is the study of whether pebbles from one set of vertices can be moved to another while pebbles are lost in the process. A number of variations on the theme have been presented over the years. In this paper we provide a common framework for studying them all, and present the main techniques and results. Some new variations are introduced as well and open problems are highlighted.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,