𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for the chromatic capacity in terms of the chromatic number of a graph

✍ Scribed by Zhou, Bing

Book ID
120663747
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
369 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bound on the chromatic number of a gra
A bound on the chromatic number of a graph
✍ Paul A. Catlin πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.

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 bound for the game chromatic number of
A bound for the game chromatic number of graphs
✍ Thomas Dinski; Xuding Zhu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula