✦ LIBER ✦

Strengthening the Lovászbound for graph coloring

✍ Scribed by Philippe Meurdesoif

Book ID: 106276163
Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 299 KB
Volume: 102
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070100246

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring and the Lovász Local Lemma

✍ Xing Chen; Zhihua Du; Jixiang Meng 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 304 KB

The Lovász Local Lemma yields sufficient conditions for a hypergraph to be 2-colorable, that is, to have a coloring of the points blue or red such that no edge is monochromatic. The method yields a general theorem, which shows for example, if H is a hypergraph in which each edge contains at least 9

The asymptotic behaviour of lovász’ ϑ fu

The asymptotic behaviour of lovász’ ϑ function for random graphs

✍ Ferenc Juhász 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 77 KB

Exact Formulae for the Lovász Theta Func

Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs

✍ Crespi, Valentino 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 135 KB

Hybrid Evolutionary Algorithms for Graph

Hybrid Evolutionary Algorithms for Graph Coloring

✍ Philippe Galinier; Jin-Kao Hao 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 101 KB

Graph coloring bounds for cellular radio

✍ Pierre Baldi; Edward C. Posner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 321 KB

A graph coloring problem usdul in deciding whether a set of call requests in cellular radio is compatible with frequency use constraints is introduced. Lower and upper bounds are obtained for the hexagonal cell case typical of raany urban cellular systems. These bounds are on the number of frequenci

Learning classifier system for graph col

Learning classifier system for graph coloring

✍ Zoheir Ezziane 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB