liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
On a number of colors in cyclically interval edgecolorings of trees
Linköping University, Department of Mathematics. Linköping University, The Institute of Technology. (Institute for Informatics and Automation Problems, National Academy of Sciences of RA, Republic of Armenia)
2010 (English)Report (Other academic)
Abstract [en]

A proper edge t-coloring of a graph G is a coloring of edges of G with colors 1,2,...,t such that each edge receives one color and no two adjacent edges receive the same color. A proper edge t-coloring of  G is called  a cyclically interval t-coloring if 1) at least one edge is colored k, for each k=1,2,...,t., and 2) for each vertex v of G the colors of edges incident with v are consecutive modulo t.We find, for an arbitrary tree G, all possible values of t  for which G admits a cyclically interval  t-coloring.

Place, publisher, year, edition, pages
Linköping University: Electronic Press , 2010. , 9 p.
National Category
Discrete Mathematics
URN: urn:nbn:se:liu:diva-59514Local ID: LiTH-MAT-R--2010/09--SEOAI: diva2:351993
Available from: 2010-09-17 Created: 2010-09-17

Open Access in DiVA

No full text

By organisation
Department of MathematicsThe Institute of Technology
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 57 hits
ReferencesLink to record
Permanent link

Direct link