In this paper 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.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1564,
author = {Laura Frigerio and Federico Lastaria and Norma Zagaglia Salvi},
title = {Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle},
journal = {Discussiones Mathematicae Graph Theory},
volume = {31},
year = {2011},
pages = {547-557},
zbl = {1229.05103},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1564}
}
Laura Frigerio; Federico Lastaria; Norma Zagaglia Salvi. Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle. Discussiones Mathematicae Graph Theory, Tome 31 (2011) pp. 547-557. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1564/
[000] [1] P.N. Balister, E. Györi, J. Lehel and R.H. Schelp, Adjacent vertex distinguishing edge-colorings, SIAM J. Discrete Math. 21 (2007) 237-250, doi: 10.1137/S0895480102414107. | Zbl 1189.05056
[001] [2] J.L. Baril, H. Kheddouci and O. Togni, Adjacent vertex distinguishing edge-colorings of meshes, Australasian J. Combin. 35 (2006) 89-102. | Zbl 1108.05035
[002] [3] P.K. Jha, Kronecker products of paths and cycles: decomposition, factorization and bi-pancyclicity, Discrete Math. 182 (1998) 153-167, doi: 10.1016/S0012-365X(97)00138-6. | Zbl 0890.05052
[003] [4] D.B. West, Introduction to Graph Theory, second ed. (Prentice Hall, Englewood Cliffs, NY, USA, 2001).
[004] [5] Z. Zhang, L. Liu and J. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15 (2002) 623-626, doi: 10.1016/S0893-9659(02)80015-5. | Zbl 1008.05050