Abstract:A total coloring for a graph G is an assignment of colors to the edges and vertices of G such that any pair of adjacent or incident elements have different colors. The least number of colors for which G has a total coloring is denoted χ ′′ (G). It is known that splitcomparability graphs have χ ′′ (G) at most ∆(G) + 2. In this work we show that certain split-comparability graphs with odd maximum degree have χ ′′ (G) = ∆(G) + 1.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.