✦ LIBER ✦

Randomized online graph coloring

✍ Scribed by Sundar Vishwanathan

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 793 KB
Volume: 13
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(92)90061-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring graph bundles

✍ Sandi Klavžar; Bojan Mohar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 502 KB

## Abstract Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. © 1995 John Wiley & Sons, Inc.

Algorithms for coloring semi-random grap

Algorithms for coloring semi-random graphs

✍ C. R. Subramanian; Martin Fürer; C. E. Veni Madhavan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB 👁 3 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co

Asymmetric graph coloring games

✍ H. A. Kierstead 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract We introduce the (__a,b__)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat

On-Line Coloring of Sparse Random Graphs

On-Line Coloring of Sparse Random Graphs and Random Trees

✍ Boris Pittel; Robert S. Weishaar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 164 KB

The performance of the greedy coloring algorithm ''first fit'' on sparse random graphs G and on random trees is investigated. In each case, approximately n, c r n log log n colors are used, the exact number being concentrated almost surely on at 2 most two consecutive integers for a sparse random gr

Graph Coloring and Reverse Mathematics

✍ James H. Schmerl 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

Scalable parallel graph coloring algorit

Scalable parallel graph coloring algorithms

✍ Gebremedhin, Assefaw Hadish ;Manne, Fredrik 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 1 views