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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
