%0 Journal Article
%T Note on Cyclically Interval Edge  Colorings of Simple Cycles
%A Nannan Wang
%A Yongqiang Zhao
%J Open Journal of Discrete Mathematics
%P 180-184
%@ 2161-7643
%D 2016
%I Scientific Research Publishing
%R 10.4236/ojdm.2016.63016
%X A proper edge <em>t</em>-coloring of a graph G is a coloring of its edges with colors &nbsp;1, 2,..., <em>t</em>,&nbsp;such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval <em>t</em>-coloring of a graph G is a proper edge <em>t</em>-coloring of G such that for each vertex<img src=\"Edit_072f918e-8152-4568-b36c-d45c373f068e.bmp\" alt=\"\" />, either the set of colors used on edges incident to <em>x</em> or the set of colors not used on edges incident to <em>x</em> 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, <em>Open Journal of Discrete Mathematics</em>, 2013, 43-48¡±.
%K Edge Coloring
%K Interval Edge Coloring
%K Cyclically Interval Edge Coloring
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=68524