𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic complexity of list colorings

✍ Scribed by Jan Kratochvíl; Zsolt Tuza

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
420 KB
Volume
50
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Oriented list colorings of graphs
Oriented list colorings of graphs
✍ Zs. Tuza; M. Voigt 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

A 2-assignment on a graph G (V,E) is a collection of pairs Lv of allowed colors speci®ed for all vertices v PV. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satis®es the following property: For every 2-assignment there exists a choic

List T-colorings of graphs
List T-colorings of graphs
✍ Barry A. Tesman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 876 KB
On the number of list-colorings
On the number of list-colorings
✍ Quentin Donner 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract Given a __list of boxes L__ for a graph __G__ (each vertex is assigned a finite set of colors that we call a box), we denote by __f__(__G, L__) the number of L‐__colorings__ of __G__ (each vertex must be colored wiht a color of its box). In the case where all the boxes are identical and