A note on fall colorings of Kneser graphs
Combinatorics
2018-11-13 v2
Abstract
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 short note, we characterize all fall colorings of Kneser graphs of type KG(n,2).
Cite
@article{arxiv.0909.2772,
title = {A note on fall colorings of Kneser graphs},
author = {Saeed Shaebani},
journal= {arXiv preprint arXiv:0909.2772},
year = {2018}
}