Abstract
A total coloring of a graph is an assignment of colors to both its vertices and edges so that adjacent or incident elements acquire distinct colors. In this note, we give a simple greedy algorithm to totally color a rooted path graph G with at most Δ(G)+2 colors, where Δ(G) is the maximum vertex degree of G. Our algorithm is inspired by a method by Bojarshinov (2001) [3] for interval graphs and provides a new proof that the Total Coloring Conjecture, posed independently by Behzad (1965) [1] and Vizing (1968) [15], holds for rooted path graphs. In the process, we also prove a useful property of greedy neighborhood coloring for chordal graphs.
Sign-in/Register to access full text options 
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.
