Autor:	Petrosyan, Petros A., Khachatrian, Hrant H., Yepremyan, Liana E., Tananyan, Hovhannes G.
Rok vydání:	2011
Předmět:	Computer Science - Discrete Mathematics Mathematics - Combinatorics
Zdroj:	Proceedings of the CSIT Conference, Yerevan, 2011, pp. 89-92
Druh dokumentu:	Working Paper
Popis:	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. Comment: 4 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1110.1165 Zobrazit plný text záznamu View this record from Arxiv