TITLE:
On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles
AUTHORS:
Rafayel R. Kamalian
KEYWORDS:
Proper Edge Coloring; Cyclically Interval Coloring; Simple Cycle
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.3 No.1,
January
29,
2013
ABSTRACT: 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 its vertex x, 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. For an arbitrary simple cycle, all possible values of t are found, for which the graph has a cyclically interval t-coloring.