𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Online vertex-coloring games in random graphs

✍ Scribed by Martin Marciniszyn; Reto Spöhel

Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
541 KB
Volume
30
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-factor in random graphs based on ver
One-factor in random graphs based on vertex choice
✍ E. Shamir; E. Upfal 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 541 KB

The following result is proved: Consider a random graph on n vertices where each ?'zitex chooses randomIy a set of c neigh~rs. If c 26, then the graph has a l-factor, with probability + 1 as tt ---, ~0.

Defining sets in vertex colorings of gra
Defining sets in vertex colorings of graphs and latin rectangles
✍ E.S. Mahmoodian; Reza Naserasr; Manouchehr Zaker 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 410 KB

In a given graph G, a set of vertices S with an assignment of colors is said to be a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a z(G)coloring of the vertices of G. The concept of a defining set has been studied, to some extent, for block desig