𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound on the chromatic number of a graph

✍ Scribed by B. R. Myers; R. Liu

Publisher
John Wiley and Sons
Year
1971
Tongue
English
Weight
150 KB
Volume
1
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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.

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