Document Type: Research Paper
School of Mathematics and Computer Science,
P.O. Box 36716-41167, Damghan, Iran
A fall coloring of a graph $G$ is a proper coloring of $G$ with $k$ colors such that each vertex sees all $k$ colors on its closed neighborhood. In this paper, we characterize all fall colorings of Kneser graphs of type $KG(n,2)$.