✦ LIBER ✦

Pebbling numbers of some graphs

✍ Scribed by Rongquan Feng; Ju Young Kim

Book ID: 105637355
Publisher: SP Science China Press
Year: 2002
Tongue: English
Weight: 201 KB
Volume: 45
Category: Article
ISSN: 1674-7283
DOI: 10.1007/bf02872335

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The cover pebbling number of graphs

✍ Betsy Crull; Tammy Cundiff; Paul Feltman; Glenn H. Hurlbert; Lara Pudwell; Zsuzs 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 184 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

Pebbling Graphs of Diameter Three and Fo

Pebbling Graphs of Diameter Three and Four

✍ Luke Postle; Noah Streib; Carl Yerger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Ramsey Numbers of Some Bipartite Graphs

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

✍ Tao Jiang; Michael Salerno 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 147 KB

Some Ramsey numbers for directed graphs

✍ J.C. Bermond 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 822 KB

Local Ramsey numbers for some graphs

✍ Halina Bielak 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 166 KB