✦ LIBER ✦

An algorithm for coloring some perfect graphs

✍ Scribed by Hacène Aït Haddadène; Sylvain Gravier; Frédéric Maffray

Book ID: 108316154
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 881 KB
Volume: 183
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00082-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(N2) algorithm for coloring perfect

An O(N2) algorithm for coloring perfect planar graphs

✍ Alan Tucker; Donna Wilson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 501 KB

Some perfect coloring properties of grap

Some perfect coloring properties of graphs

✍ Claude A Christen; Stanley M Selkow 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 630 KB

Coloring Bull-Free Perfect Graphs

✍ Penev, Irena 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 359 KB

An algorithm for colouring perfect plana

An algorithm for colouring perfect planar graphs

✍ Iain A. Stewart 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 685 KB

An effective heuristic algorithm for sum

An effective heuristic algorithm for sum coloring of graphs

✍ Qinghua Wu; Jin-Kao Hao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 285 KB

An Õ(n314)-coloring algorithm for 3-col

An Õ(n314)-coloring algorithm for 3-colorable graphs

✍ Avrim Blum; David Karger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 471 KB

We show how the results of Karger, Motwani, and Sudan ( 1994) and Blum ( 1994) can be combined in a natural manner to yield a polynomial-time algorithm for d(n3"4 )-coloring any n-node 3-colorable graph. This improves on the previous best bound of 6(n'14) colors (Karger et al., 1994).