@article{a849f4e8fbc542f0987dc0b7dd444a7c,
title = "Edge-Face Total Chromatic Number of Halin Graphs",
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.",
keywords = "Edge-face total chromatic number, Halin graphs",
author = "Chan, {W. H.} and Lam, {Peter C. B.} and Shiu, {W. C.}",
note = "Funding information: This work was partially supported by Faculty Research Grant (FRG/07-08/II-30), Hong Kong Baptist University, and CERG (HKBU210207), Research Grant Council, Hong Kong. Publisher copyright: Copyright {\textcopyright} 2009 Society for Industrial and Applied Mathematics",
year = "2009",
month = nov,
day = "11",
doi = "10.1137/070687988",
language = "English",
volume = "23",
pages = "1646--1654",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics (SIAM)",
number = "3",
}