✦ LIBER ✦

Two Novel Evolutionary Formulations of the Graph Coloring Problem

✍ Scribed by Valmir C. Barbosa; Carlos A.G. Assis; Josina O. Do Nascimento

Book ID: 111592082
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 242 KB
Volume: 8
Category: Article
ISSN: 1382-6905
DOI: 10.1023/b:joco.0000021937.26468.b2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The two-mutant problem: clonal interfere

The two-mutant problem: clonal interference in evolutionary graph theory

✍ Chris Paley; Sergei Taraskin; Stephen Elliott 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 410 KB

On some applications of the selective gr

On some applications of the selective graph coloring problem

✍ Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, Cerasela 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A Novel Evolutionary Formulation of the

A Novel Evolutionary Formulation of the Maximum Independent Set Problem

✍ Valmir C. Barbosa; Luciana C. D. Campos 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 172 KB

A theoretical analysis of backtracking i

A theoretical analysis of backtracking in the graph coloring problem

✍ Edward A Bender; Herbert S Wilf 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 334 KB

The Two-Coloring Number and Degenerate C

The Two-Coloring Number and Degenerate Colorings of Planar Graphs

✍ Kierstead, Hal; Mohar, Bojan; Špacapan, Simon; Yang, Daqing; Zhu, Xuding 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

On the two-edge-colorings of perfect gra

On the two-edge-colorings of perfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 Joh