✦ LIBER ✦

The cover pebbling number of graphs

✍ Scribed by Betsy Crull; Tammy Cundiff; Paul Feltman; Glenn H. Hurlbert; Lara Pudwell; Zsuzsanna Szaniszlo; Zsolt Tuza

Book ID: 108113544
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 184 KB
Volume: 296
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.03.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pebbling numbers of some graphs

✍ Rongquan Feng; Ju Young Kim 📂 Article 📅 2002 🏛 SP Science China Press 🌐 English ⚖ 201 KB

Maximum pebbling number of graphs of dia

Maximum pebbling number of graphs of diameter three

✍ Boris Bukh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

## Abstract 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 to __v__. A graph is called __pebbleable__ if for each vertex __v__ there is a sequence of pebbli

The pebbling number of C5 × C5

✍ David S. Herscovici; Aparna W. Higgins 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Chung has defined a pebbling move on a graph G to be the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number f(G) of a connected graph is the least number of pebbles such that any distribution of f(G) pebbles on G allows one pebble to be m

The Complexity of Pebbling in Diameter T

The Complexity of Pebbling in Diameter Two Graphs

✍ Cusack, Charles A.; Lewis, Timothy; Simpson, Daniel; Taggart, Samuel 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

The Complexity of Graph Pebbling

✍ Milans, Kevin; Clark, Bryan 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 343 KB