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.
| Original language | English |
|---|---|
| Pages (from-to) | 2289-2295 |
| Number of pages | 7 |
| Journal | Taiwanese Journal of Mathematics |
| Volume | 16 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2012 |
User-Defined Keywords
- Complement graph
- Domination number
- Incidence chromatic number
- Regular graph
Fingerprint
Dive into the research topics of 'Incidence coloring of regular graphs and complement graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver