✦ LIBER ✦

Coloring k-colorable graphs using relatively small palettes

✍ Scribed by Eran Halperin; Ram Nathaniel; Uri Zwick

Book ID: 108421609
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 158 KB
Volume: 45
Category: Article
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(02)00217-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Coloring k-Colorable Graphs in P

Minimum Coloring k-Colorable Graphs in Polynomial Average Time

✍ C.R. Subramanian 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present algorithms for minimum G -coloring k-colorable graphs drawn from random and semi-random models. In both models, an adversary initially splits Ž . the vertices into k color classes V , . . . , V of sizes ⍀ n each. In the first model,

Relative colorings of graphs

✍ Paul C Kainen 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Generating Color Palettes using Intuitiv

Generating Color Palettes using Intuitive Parameters

✍ Martijn Wijffelaars; Roel Vliegen; Jarke J. Van Wijk; Erik-Jan Van Der Linden 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

Almost all k-colorable graphs are easy t

Almost all k-colorable graphs are easy to color

✍ Jonathan S Turner 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 972 KB

k-fold coloring of planar graphs

✍ GuanFeng Ren; YueHua Bu 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 296 KB

Incidence coloring of k-degenerated grap

Incidence coloring of k-degenerated graphs

✍ Mohammad Hosseini Dolama; Éric Sopena; Xuding Zhu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 269 KB