✦ LIBER ✦

The game Grundy number of graphs

✍ Scribed by Frédéric Havet, Xuding Zhu

Book ID: 120694176
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 469 KB
Volume: 25
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9513-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Grundy number of graphs with few

On the Grundy number of graphs with few ’s

✍ J. Araujo; C. Linhares Sales 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 293 KB

On the family of -regular graphs with Gr

On the family of -regular graphs with Grundy number

✍ Gastineau, Nicolas; Kheddouci, Hamamache; Togni, Olivier 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 733 KB

On the Grundy andb-Chromatic Numbers of

On the Grundy andb-Chromatic Numbers of a Graph

✍ Frédéric Havet, Leonardo Sampaio 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 521 KB

New Bounds on the Grundy Number of Produ

New Bounds on the Grundy Number of Products of Graphs

✍ Victor Campos; András Gyárfás; Frédéric Havet; Claudia Linhares Sales; Frédéric 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

Game matching number of graphs

✍ Cranston, Daniel W.; Kinnersley, William B.; O, Suil; West, Douglas B. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On the equality of the grundy and ochrom

On the equality of the grundy and ochromatic numbers of a graph

✍ P. Erdös; W. R. Hare; S. T. Hedetniemi; R. Laskar 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

It is proved in this note that the Grundy number, r(G), and the ochromatic number, xo(G), are the same for any graph G. An n-coloring of a graph G = ( V , E ) is a f u n c t i o n f f r o m V onto N = { I , 2 , . . . , n } such that, whenever vertices id and u are adjacent, then f ( u ) f f(u). An