About Fall Colorings of Graphs

Details About Fall Colorings of Graphs About Fall Colorings of Graphs

2009-09-15

arxiv.org/abs/0909.2775v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

About Fall Colorings of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with About Fall Colorings of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and About Fall Colorings of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555851