Author(s)

Nannan Wang¹, Yongqiang Zhao^2*

¹Institute of Applied Mathematics, Hebei University of Technology, Tianjin, China.
²School of Mathematics and Information Science, Shijiazhuang University, Shijiazhuang, China.

A proper edge t-coloring of a graph G is a coloring of its edges with colors  1, 2,..., t, such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each vertex, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. In this paper, we provide a new proof of the result on the colors in cyclically interval edge colorings of simple cycles which was first proved by Rafayel R. Kamalian in the paper “On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles, Open Journal of Discrete Mathematics, 2013, 43-48”.

Edge Coloring, Interval Edge Coloring, Cyclically Interval Edge Coloring

Wang, N. and Zhao, Y. (2016) Note on Cyclically Interval Edge Colorings of Simple Cycles. Open Journal of Discrete Mathematics, 6, 180-184. doi: 10.4236/ojdm.2016.63016.