Total Colorings of Product Graphs
- 146 Downloads
A total coloring of a graph is an assignment of colors to all the elements of the graph in such a way that no two adjacent or incident elements receive the same color. In this paper, we prove Behzad–Vizing conjecture for product graphs. In particular, we obtain the tight bound for certain classes of graphs.
KeywordsProduct graphs Direct product Strong product Lexicographic product Total coloring
We are grateful to the reviewers for their valuable and helpful comments which lead to the improvement of this paper. This work was supported by SERB (No. SB/S4/MS:867/14).
- 1.Behzad, M.: Graphs and Their Chromatic Numbers, Doctoral Thesis. Michigan State University, East Lansing (1965)Google Scholar
- 2.Behzad, M.: The Total Chromatic Number, Combinatorial Mathematics and Its Applications, Proc, Conf., Oxford 1969, pp. 1–8. Academic Press, London (1971)Google Scholar
- 13.Vizing, V.G.: Some unsolved problems in graph theory (in Russian). Uspekhi Matematicheskikh Nauk 23, 117–134 [English translation in Russian Mathematical Surveys 23, 125–141 (1968)]Google Scholar