Frigerio, Laura; Lastaria, Federico; Zagaglia Salvi, Norma Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle. (English) Zbl 1229.05103 Discuss. Math., Graph Theory 31, No. 3, 547-557 (2011). Summary: We investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph \(G\) in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of \(G\) by a path or a cycle. Cited in 1 Document MSC: 05C15 Coloring of graphs and hypergraphs 05C38 Paths and cycles 05C76 Graph operations (line graphs, products, etc.) Keywords:chromatic index; adjacent vertex distinguishing edge coloring; direct product; matching PDFBibTeX XMLCite \textit{L. Frigerio} et al., Discuss. Math., Graph Theory 31, No. 3, 547--557 (2011; Zbl 1229.05103) Full Text: DOI