2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2009★ 2 cited
On the b-chromatic number of Kneser Graphs
Hossein Hajiabolhassan
In this note, we prove that for any integer the b-chromatic number of the Kneser graph is greater than or equal to . Th…
math.CO2009
Circular Coloring and Mycielski Construction
Meysam Alishahi, Hossein Hajiabolhassan
In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in \cite{MR2279672} that Mycielskian of the Kneser graph $KG(…
math.CO2009
A Generalization of the Erdös-Ko-Rado Theorem
Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani
In this note, we investigate some properties of local Kneser graphs defined in [8]. In this regard, as a generalization of the Erds-Ko-Rado theorem, we characterize…