✦ LIBER ✦

The Vertex Coloring Problem and its generalizations

✍ Scribed by Enrico Malaguti

Publisher: Springer
Year: 2008
Tongue: English
Weight: 84 KB
Volume: 7
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-008-0071-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The jeep problem and its generalizations

✍ B. Hajtman 📂 Article 📅 1963 🏛 Springer US 🌐 English ⚖ 41 KB

Maximizing the number of unused colors i

Maximizing the number of unused colors in the vertex coloring problem

✍ Refael Hassin; Shlomo Lahav (Haddad) 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 321 KB

An Unconstrained Quadratic Binary Progra

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem

✍ Gary A. Kochenberger; Fred Glover; Bahram Alidaee; Cesar Rego 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 225 KB

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

On a problem of Zalcman and its generali

On a problem of Zalcman and its generalizations

✍ V. V. Volchkov 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 288 KB

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