About Fall Colorings of Graphs
Combinatorics
2009-09-16 v1
Abstract
A fall -coloring of a graph is a proper -coloring of such that each vertex of sees all colors on its closed neighborhood. In this paper, we answer some questions of \cite{dun} about some relations between fall colorings and some other types of graph colorings.
Cite
@article{arxiv.0909.2775,
title = {About Fall Colorings of Graphs},
author = {Saeed Shaebani},
journal= {arXiv preprint arXiv:0909.2775},
year = {2009}
}