2000 character limit reached
Interval edge-colorings of graph products (1110.1165v2)
Published 6 Oct 2011 in cs.DM and math.CO
Abstract: An interval t-coloring of a graph G is a proper edge-coloring of G with colors 1,2,...,t such that at least one edge of G is colored by i, i=1,2,...,t, and the edges incident to each vertex v\in V(G) are colored by d_{G}(v) consecutive colors, where d_{G}(v) is the degree of the vertex v in G. In this paper interval edge-colorings of various graph products are investigated.