OJDM  Vol.7 No.4 , October 2017
Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles
Abstract: A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a set of k consecutive integers. A cyclically interval total t-coloring of a graph G is a total coloring a of G with colors 1,2,...,t, such that at least one vertex or edge of G is colored by i,i=1,2,...,t, and for any, the set is a -interval, or is a -interval, where dG(x) is the degree of the vertex x in G. In this paper, we study the cyclically interval total colorings of cycles and middle graphs of cycles.
Cite this paper: Zhao, Y. and Su, S. (2017) Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles. Open Journal of Discrete Mathematics, 7, 200-217. doi: 10.4236/ojdm.2017.74018.

[1]   Vizing, V.G. (1965) Chromatic Index of Multigraphs. Doctoral Thesis, Novosibirsk. (in Russian)

[2]   Behzad, M. (1965) Graphs and Their Chromatic Numbers. Ph.D. Thesis, Michigan State University, East Lansing, MI.

[3]   Petrosyan, P.A. (2007) Interval Total Colorings of Complete Bipartite Graphs. Proceedings of the CSIT Conference, Yerevan, 84-85.

[4]   Yap, H.P. (1996) Total Colorings of Graphs, Lecture Notes in Mathematics 1623. Springer-Verlag , Berlin.

[5]   Petrosyan, P.A., Torosyan, A.Yu. and Khachatryan, N.A. (2010) Interval Total Colorings of Graphs . arXiv:1010.2989v1.