Abstract
We show that the edge-face total chromatic number of Halin graphs with maximum vertex degree $\Delta$ not less than 4 is equal to $\max\{5,\Delta\}$. For the cases of $\Delta=4$ and 5, we provide a proper 5-edge-face total coloring algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
