𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring perfect degenerate graphs

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

Book ID
108316041
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
257 KB
Volume
163
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring precolored perfect graphs
Coloring precolored perfect graphs
✍ Kratochv�l, Jan; Seb?, Andr�s 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We consider the question of the computational complexity of coloring perfect graphs with some precolored vertices. It is well known that a perfect graph can be colored optimally in polynomial time. Our results give a sharp border between the polynomial and NP-complete instances, when precolored vert

Acyclic edge coloring of 2-degenerate gr
Acyclic edge coloring of 2-degenerate graphs
✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB 👁 1 views

## Abstract An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). A graph is