On a number of vertices with an interval spectrum in proper edge colorings of some graphs
2011 (English)Report (Other academic)
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, each color is used at least for one edge, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x of G is called a spectrum of x.
A proper edge t-coloring of a graph G is interval for a vertex x of G if the spectrum of x is an interval of integers. A proper edge t-coloring of a graph G is persistent-interval for a vertex x of G if the spectrum of x is an interval of integers with 1 as it's least element.
For graphs G from some classes of graphs, we obtain estimates for the possible number of vertices for which a proper edge t-coloring of G can be interval or persistent-interval.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press , 2011. , 11 p.
IdentifiersURN: urn:nbn:se:liu:diva-64674Local ID: LiTH-MAT-R--2011/03--SEOAI: oai:DiVA.org:liu-64674DiVA: diva2:393835