๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the locating chromatic number of Kneser graphs

โœ Scribed by Ali Behtoei; Behnaz Omoomi

Book ID
113564650
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
247 KB
Volume
159
Category
Article
ISSN
0166-218X

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

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