Incidence coloring of Regular graphs and Complement graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.