𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast parallel algorithm to color a graph with Δ colors

✍ Scribed by Mauricio Karchmer; Joseph Naor

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
502 KB
Volume
9
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Competitive Graph Coloring Algo
A Simple Competitive Graph Coloring Algorithm
✍ H.A. Kierstead 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu

Coloring a graph optimally with two colo
Coloring a graph optimally with two colors
✍ H.J. Broersma; F. Göbel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Let G be a graph with point set V. A (2.)c,oloring of G is a map of V to ired, white!. An error occurs whenever the two endpoints of a line have the same color. An oprimul doring of G is a coloring of G for which the number of errors is minimum. The minimum number of errors is denoted by y(G), we de