𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Ordered Colorings

✍ Scribed by Gupta, Arvind; van den Heuvel, Jan; Maňuch, Ján; Stacho, Ladislav; Zhao, Xiaohong


Book ID
118197653
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
259 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On colorings of maps
✍ M.A. van Hartskamp; J. Vermeer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 610 KB
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