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

HTML  XML Download Download as PDF (Size: 173KB)  PP. 43-48  
DOI: 10.4236/ojdm.2013.31009    3,414 Downloads   5,771 Views  Citations

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.

Share and Cite:

R. Kamalian, "On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles," Open Journal of Discrete Mathematics, Vol. 3 No. 1, 2013, pp. 43-48. doi: 10.4236/ojdm.2013.31009.
Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.