Interval edge-colorings of graph products
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2011
- DOI:
- 10.48550/arXiv.1110.1165
- arXiv:
- arXiv:1110.1165
- Bibcode:
- 2011arXiv1110.1165P
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Mathematics - Combinatorics
- E-Print:
- 4 pages