𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Grundy number of graphs with few ’s

✍ Scribed by J. Araujo; C. Linhares Sales


Book ID
119225002
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
293 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the equality of the grundy and ochrom
✍ 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