✦ LIBER ✦

Covering radius and the chromatic number of Kneser graphs

✍ Scribed by A.R Calderbank

Book ID: 107885126
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 128 KB
Volume: 54
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(90)90011-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number ofq-Kneser graph

On the chromatic number ofq-Kneser graphs

✍ A. Blokhuis, A. E. Brouwer, T. Szőnyi 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 163 KB

Multichromatic numbers, star chromatic n

Multichromatic numbers, star chromatic numbers and Kneser graphs

✍ Johnson, A.; Holroyd, F. C.; Stahl, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by χ \* and η \* , the work of the above authors shows that χ \* (G) = η \* (G) if G is bipartite, an odd cy

On the locating chromatic number of Knes

On the locating chromatic number of Kneser graphs

✍ Ali Behtoei; Behnaz Omoomi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 247 KB

On the chromatic number of the general K

On the chromatic number of the general Kneser-graph

✍ P. Frankl 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Circular chromatic numbers of some reduc

Circular chromatic numbers of some reduced Kneser graphs

✍ Ko-Wei Lih; Daphne Der-Fen Liu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

## Abstract The vertex set of the reduced Kneser graph KG~2~(__m,2__) consists of all pairs {__a,b__} such that __a, b__ε{1,2,…,__m__} and 2≤|__a__−__b__|≤__m__−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if __m__≥4 __and m__≠5, then the circular chromatic number

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