Optimal Pebbling Number of the Square Grid

A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The optimal pebbling number π opt is the smallest number m needed to guaran...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2020-05, Vol.36 (3), p.803-829
Hauptverfasser:	Győri, Ervin, Katona, Gyula Y., Papp, László F.
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Graph theory Lower bounds Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!