✦ LIBER ✦

On some applications of the selective graph coloring problem

✍ Scribed by Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, Cerasela

Book ID: 124139843
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 569 KB
Volume: 240
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.05.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the selective graph

On the complexity of the selective graph coloring problem in some special classes of graphs

✍ Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Heuristic algorithms and learning techni

Heuristic algorithms and learning techniques: applications to the graph coloring problem

✍ Porumbel, Daniel Cosmin 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 645 KB

Some results on the incidence coloring n

Some results on the incidence coloring number of a graph

✍ Jiaojiao Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 444 KB

New Results on the Queens_n2Graph Colori

New Results on the Queens_n2Graph Coloring Problem

✍ Michel Vasquez 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 119 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

Two Novel Evolutionary Formulations of t

Two Novel Evolutionary Formulations of the Graph Coloring Problem

✍ Valmir C. Barbosa; Carlos A.G. Assis; Josina O. Do Nascimento 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 242 KB