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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
