On Fall Colorings of Kneser Graphs

Details On Fall Colorings of Kneser Graphs On Fall Colorings of Kneser Graphs

2009-09-15

arxiv.org/abs/0909.2772v1

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 note, we
characterize all fall colorings of Kneser graphs of type KG(n,2) for n\geq2 and
study some fall colorings of KG(n,m) in some special cases and introduce some
bounds for fall colorings of Kneser graphs.

Affiliated with

Also associated with

No associations

Rating

On Fall Colorings of Kneser 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 On Fall Colorings of Kneser Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Fall Colorings of Kneser Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555848