✦ LIBER ✦

A Note on Graph Pebbling

✍ Scribed by Andrzej Czygrinow; Glenn Hurlbert; H.A. Kierstead; William T. Trotter

Book ID: 106048105
Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 110 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On pebbling threshold functions for grap

On pebbling threshold functions for graph sequences

✍ Andrzej Czygrinow; Nancy Eaton; Glenn Hurlbert; P. Mark Kayll 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Colored pebble motion on graphs

✍ Shinya Fujita; Tomoki Nakamigawa; Tadashi Sakuma 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 263 KB

A note on the pebble game

✍ Michael C. Loui 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 341 KB

Multi-Color Pebble Motion on Graphs

✍ Gilad Goraly; Refael Hassin 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 628 KB

Thresholds for random distributions on g

Thresholds for random distributions on graph sequences with applications to pebbling

✍ Jeffrey A. Boyle 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 120 KB

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using