Geodesic
Equitable coloring of Kneser graphs
Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 1, pp. 119-142

Voir la notice de l'article provenant de la source Library of Science

The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set 1,2,...,n and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs, namely, we establish the equitable chromatic number for graphs K(n,2) and K(n,3). In addition, for sufficiently large n, a tight upper bound on equitable chromatic number of graph K(n,k) is given. Finally, the cases of K(2k,k) and K(2k+1,k) are discussed.
Keywords: equitable coloring, Kneser graph 
@article{DMGT_2009_29_1_a7,
     author = {Fidytek, Robert and Furma\'nczyk, Hanna and \.Zyli\'nski, Pawe{\l}},
     title = {Equitable coloring of {Kneser} graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {119--142},
     publisher = {mathdoc},
     volume = {29},
     number = {1},
     year = {2009},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a7/}
}
TY  - JOUR
AU  - Fidytek, Robert
AU  - Furmańczyk, Hanna
AU  - Żyliński, Paweł
TI  - Equitable coloring of Kneser graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2009
SP  - 119
EP  - 142
VL  - 29
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a7/
LA  - en
ID  - DMGT_2009_29_1_a7
ER  - 
%0 Journal Article
%A Fidytek, Robert
%A Furmańczyk, Hanna
%A Żyliński, Paweł
%T Equitable coloring of Kneser graphs
%J Discussiones Mathematicae. Graph Theory
%D 2009
%P 119-142
%V 29
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a7/
%G en
%F DMGT_2009_29_1_a7
Fidytek, Robert; Furmańczyk, Hanna; Żyliński, Paweł. Equitable coloring of Kneser graphs. Discussiones Mathematicae. Graph Theory, Tome 29 (2009) no. 1, pp. 119-142. http://geodesic.mathdoc.fr/item/DMGT_2009_29_1_a7/