✦ LIBER ✦

An inequality for the group chromatic number of a graph

✍ Scribed by Hong-Jian Lai; Xiangwen Li; Gexin Yu

Book ID: 108113785
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 130 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inequalities for the chromatic numbers o

Inequalities for the chromatic numbers of graphs

✍ K Schürger 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Some inequalities on the chromatic numbe

Some inequalities on the chromatic number of a graph

✍ T. King; G.L. Nemhauser 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Inequalities between the domination numb

Inequalities between the domination number and the chromatic number of a graph

✍ Dieter Gernert 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds for u + x and ax are proved, where u is the domination number and x the chromatic number of a graph.

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 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