35 citations · 70 across the 19 of their papers we have counts for
Showing 2009 · math.COShow all
3 papers · 2 filters
math.CO2009★ 5 cited
On Dynamic Coloring of Graphs
Meysam Alishahi
A dynamic coloring of a graph is a proper coloring such that for every vertex of degree at least 2, the neighbors of receive at least 2 colors. In this paper we…
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…