Incidence coloring of Regular graphs and Complement graphs

2012/03/28 by Pak Kiu Sun, Sun, Pak Kiu
Mathematics · #05C15 #05C69 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C15 #msc:05C69

paper · pdf · doi:10.48550/arxiv.1203.6145

This paper have been withdrawn since the article to appear in Taiwanese Journal of Mathematics and it will offense the rules

arxiv created 2012/04/30 · arxiv updated 2012/05/01

Abstract

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 determine the optimal Nordhaus-Gaddum inequality for the incidence chromatic number.

Related

• Some Results on incidence coloring, star arboricity and domination number
• Defective incidence coloring of graphs
• Incidence coloring of graphs with high maximum average degree
• NP-completeness of 4-incidence colorability of semi-cubic graphs
• Incidence Choosability of Graphs