Various General Total Colorings of Graphs
Yang Sui-yi · Journal of Jishou University · 2011
A proper total coloring of a graph G is an assignment of colors to the edges and vertices of G in such a way that no two adjacent vertices,no two adjacent edges,and no incident vertex and edge receive the same color.In this paper,the authors weaken the constraints of the proper total coloring to obtain several general total colorings and discuss their chromatic numbers.