The Foundations of Graph Pebbling
Graph pebbling modeling started as a method for solving a combinatorialnumber theory conjecture by Erdös and Lemke. Using thismethod, Chung proved the conjecture in 1989. Since then, the literaturehas grown considerably. Several variations and possible applicationshave been discussed, in graph theor...
Main Author: | Bounadi, Monir |
---|---|
Format: | Others |
Language: | English |
Published: |
Stockholms universitet, Matematiska institutionen
2015
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-128482 |
Similar Items
-
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
by: Demaine, Erik D, et al.
Published: (2019) -
Extensions of Graph Pebbling
by: Yerger, Carl
Published: (2005) -
Optimally t-Pebbling Graphs
by: Hung-Hsing Chiang, et al.
Published: (2018) -
Optimally Pebbling Graphs
by: Chin-Lin Shiue, et al. -
The optimal pebbling of spindle graphs
by: Gao Ze-Tu, et al.
Published: (2019-11-01)