𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circumference, chromatic number and online coloring

✍ Scribed by Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan

Book ID
120912575
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
209 KB
Volume
33
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random hypergraph coloring algorithms an
Random hypergraph coloring algorithms and the weak chromatic number
✍ Jeanette Schmidt-Pruzan; Eli Shamir; Eli Upfal πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

We present a hypergraph coloring algorithm and analyze its performance in spaces of random hypergraphs. In these spaces the number of colors used by our algorithm is almost surely within a small constant factor (less than 2) of the weak chromatic number of the hypergraph. This also establishes new u

Acyclic graph coloring and the complexit
Acyclic graph coloring and the complexity of the star chromatic number
✍ David R. Guichard πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 294 KB

## Abstract Star chromatic number, introduced by A. Vince, is a natural generalization of chromatic number. We consider the question, β€œWhen is Ο‡\* < Ο‡?” We show that Ο‡\* < Ο‡ if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not i