✦ LIBER ✦

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

✍ Scribed by S.I. Roschke; A.L. Furtado

Book ID: 113161715
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 579 KB
Volume: 2
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(73)90009-4

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

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 algorithm for graph optimal monomorph

An algorithm for graph optimal monomorphism

✍ Wong, A.K.C.; You, M.; Chan, S.C. 📂 Article 📅 1990 🏛 Institute of Electrical and Electronics Engineers ⚖ 596 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

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

On an upper bound for the harmonious chr

On an upper bound for the harmonious chromatic number of a graph

✍ Zhikang Lu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph that has been given by Sin‐Min Lee and John Mitchem is improved.