✦ LIBER ✦

An Algorithm for Determining the Chromatic Number of a Graph

✍ Scribed by Corneil, D. G.; Graham, B.

Book ID: 118153807
Publisher: Society for Industrial and Applied Mathematics
Year: 1973
Tongue: English
Weight: 633 KB
Volume: 2
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0202026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for obtaining the chromatic

An algorithm for obtaining the chromatic number and an optimal coloring of a graph

✍ S.I. Roschke; A.L. Furtado 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 579 KB

A randomised heuristical algorithm for e

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

✍ Janez Z̆erovnik 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 855 KB

An inequality for the group chromatic nu

An inequality for the group chromatic number of a graph

✍ Hong-Jian Lai; Xiangwen Li; Gexin Yu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 130 KB

An upper bound for the harmonious chroma

An upper bound for the harmonious chromatic number of a graph

✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o

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.