Learn More

In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like " pegging moves " allowed. Motivated by well-studied questions in graph pebbling, we introduce two pegging quantities. The pegging number (respectively, the optimal pegging number) of a graph is the minimum number of pegs such that for every… (More)

- ‹
- 1
- ›