✦ LIBER ✦

Lower bounds for the clique and the chromatic numbers of a graph

✍ Scribed by C.S. Edwards; C.H. Elphick

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 687 KB
Volume: 5
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90015-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Towards optimal lower bounds for clique

Towards optimal lower bounds for clique and chromatic number

✍ Lars Engebretsen; Jonas Holmerin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 426 KB

It was previously known that neither Max Clique nor Min Chromatic Number can be approximated in polynomial time within n 1-, for any constant ¿ 0, unless NP = ZPP. In this paper, we extend the reductions used to prove these results and combine the extended reductions with a recent result of Samorodn

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB 👁 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Improved bounds for the chromatic number

Improved bounds for the chromatic number of a graph

✍ S. Louis Hakimi; Edward Schmeichel 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_