%0 Journal Article %T Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles %A Yongqiang Zhao %A Shijun Su %J Open Journal of Discrete Mathematics %P 200-217 %@ 2161-7643 %D 2017 %I Scientific Research Publishing %R 10.4236/ojdm.2017.74018 %X A total coloring of a graph G is a function $\"\"$ such 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 d_G(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. %K Total Coloring %K Interval Total Coloring %K Cyclically Interval Total Coloring %K Cycle %K Middle Graph %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=80010