About Fall Colorings of Graphs

MaRDI QIDQ6215463zbMATH OpenFDO

Authors Saeed Shaebani

Publication date 15 September 2009

Mathematics Subject Classification ID

Graph theory (05Cxx)

Abstract: A fall $k$-coloring of a graph $G$ is a proper $k$-coloring of $G$ such that each vertex of $G$ sees all $k$ 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.

This page was built for publication: About Fall Colorings of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6215463)