✦ LIBER ✦

A randomised heuristical algorithm for estimating the chromatic number of a graph

✍ Scribed by Janez Z̆erovnik

Book ID: 118323802
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 855 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90144-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for Determining the Chromat

An Algorithm for Determining the Chromatic Number of a Graph

✍ Corneil, D. G.; Graham, B. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 633 KB

A parallel variant of a heuristical algo

A parallel variant of a heuristical algorithm for graph colouring

✍ Janez Z̆erovnik 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 338 KB

A parallel variant of a heuristical algo

A parallel variant of a heuristical algorithm for graph coloring — Corrigendum

✍ Janez Žerovnik; Matjaž Kaufman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 213 KB

The Sigma Chromatic Number of a Graph

✍ Gary Chartrand; Futaba Okamoto; Ping Zhang 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 307 KB

The star chromatic number of a graph

✍ H. L. Abbott; B. Zhou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB 👁 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch