✦ LIBER ✦

Maximizing the number of unused colors in the vertex coloring problem

✍ Scribed by Refael Hassin; Shlomo Lahav (Haddad)

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 321 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00113-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some undecidable problems involving the

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

✍ Stefan A. Burr 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o

Linked-cluster expansion for the graph-v

Linked-cluster expansion for the graph-vertex coloration problem

✍ George A Baker Jr. 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 636 KB

Bounds on vertex colorings with restrict

Bounds on vertex colorings with restrictions on the union of color classes

✍ N. R. Aravind; C. R. Subramanian 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 1 views

Note on the reconstruction of vertex col

Note on the reconstruction of vertex colored graphs

✍ R. Taylor 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 2 views

On the number of discernible colors

✍ C. S. McCamy 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 40 KB 👁 2 views

## On the Number of Discernible On the Number of Discernible Colors Colours I was surprised that, in their study of the number of dis-The authors are grateful to Cal McCamy for his timely cernible colors, Pointer and Attridge 1 missed the early response to their original article. Neither they, nor

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