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.
Citation
Pak-Kiu Sun. "INCIDENCE COLORING OF REGULAR GRAPHS AND COMPLEMENT GRAPHS." Taiwanese J. Math. 16 (6) 2289 - 2295, 2012. https://doi.org/10.11650/twjm/1500406852
Information
