Incidence coloring of Regular graphs and Complement graphs
Combinatorics
2012-05-01 v2
Abstract
Using a relation between domination number and incidence chromatic number, we obtain necessary and sufficient conditions for -regular graphs to be -incidence colorable. Also, we determine the optimal Nordhaus-Gaddum inequality for the incidence chromatic number.
Cite
@article{arxiv.1203.6145,
title = {Incidence coloring of Regular graphs and Complement graphs},
author = {Pak Kiu Sun},
journal= {arXiv preprint arXiv:1203.6145},
year = {2012}
}
Comments
This paper have been withdrawn since the article to appear in Taiwanese Journal of Mathematics and it will offense the rules