Abstract
We show that the edge-face total chromatic number of Halin graphs with maximum vertex degree Δ not less than 4 is equal to max{5, Δ}. For the cases of Δ = 4 and 5, we provide a proper 5-edge-face total coloring algorithm. Copyright © 2009 Society for Industrial and Applied Mathematics.
Original language | English |
---|---|
Pages (from-to) | 1646-1654 |
Journal | SIAM Journal on Discrete Mathematics |
Volume | 23 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2009 |
Citation
Chan, W. H., Lam, P. C. B., & Shiu, W. C. (2009). Edge-face total chromatic number of halin graphs. SIAM Journal on Discrete Mathematics, 23(3), 1646-1654. doi: 10.1137/070687988Keywords
- Edge-face total chromatic number
- Halin graphs