Interval edgecolorings of graph products
Abstract
An interval tcoloring of a graph G is a proper edgecoloring 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 edgecolorings of various graph products are investigated.
 Publication:

arXiv eprints
 Pub Date:
 October 2011
 DOI:
 10.48550/arXiv.1110.1165
 arXiv:
 arXiv:1110.1165
 Bibcode:
 2011arXiv1110.1165P
 Keywords:

 Computer Science  Discrete Mathematics;
 Mathematics  Combinatorics
 EPrint:
 4 pages