Incidence coloring of Regular graphs and Complement graphs

Details Incidence coloring of Regular graphs and Complement graphs Incidence coloring of Regular graphs and Complement graphs

2012-03-28

arxiv.org/abs/1203.6145v1

Mathematics

Combinatorics

Scientific paper

Using a relation between domination number and incidence chromatic number, we
obtain necessary and sufficient conditions for $r$-regular graphs to be $(r +
1)$-incidence colorable. Also, we establish an inequality for the incidence
chromatic number of a graph and its complement.

Affiliated with

Also associated with

No associations

Rating

Incidence coloring of Regular graphs and Complement 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 Incidence coloring of Regular graphs and Complement graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incidence coloring of Regular graphs and Complement graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271783