On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles

• 作者: Rafayel R. Kamalian
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: PROPER Edge COLORING Cyclically INTERVAL COLORING SIMPLE CYCLE
• 年，卷（期）: 2013,（1）
• 页码范围: 43-48
• 页数: 6页
• 分类号: O1

摘要

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.