Abstract
The edge-face total chromatic number of 3-regular Halin graphs was shown to be 4 or 5 in [5]. In this paper, we shall provide a necessary and sufficient condition to characterize 3-regular Halin graphs with edge-face total chromatic number equal to four. Copyright © 2014 The Charles Babbage Research Centre.
| Original language | English |
|---|---|
| Pages (from-to) | 257-262 |
| Journal | Ars Combinatoria |
| Volume | 113 |
| Publication status | Published - Jan 2014 |
Citation
Chan, W. H., Lam, P. C. B., & Shiu, W. C. (2014). Characterization of 3-regular halin graphs with edge-face total chromatic number equal to four. Ars Combinatoria, 113, 257-262.Keywords
- Edge-face total chromatic number
- Halin graphs