223 search results - page 1 / 45 » A Note on Graph Pebbling |
75
Voted
GC
2002
Springer
15 years 27 days ago
2002
Springer
97
Voted
DM
2008
15 years 1 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
95
Voted
JGT
2006
15 years 1 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
102
Voted
ALGORITHMICA
2010
15 years 22 days ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
116
Voted
COCO
2010
Springer
15 years 5 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...