Pak Kiu Sun
Published 2012-03-28, updated 2012-04-30Version 2
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.
Comments: This paper have been withdrawn since the article to appear in Taiwanese Journal of Mathematics and it will offense the rules
Some Results on incidence coloring, star arboricity and domination number
On incidence coloring of Cartesian products of graphs
Alliance polynomial of regular graphs
![QR code for arXiv:1203.6145 [math.CO]](http://oss.arxitics.com/images/favicon.svg)