On L^′ (2, 1)–Edge Coloring Number of Regular Grids

[1] G. Chartrand, L. Lesniak and P. Zhang, Graphs and Digraphs. Sixth Edition, CRC Press, Boca Raton,2016.10.1201/b19731Search in Google Scholar

[2] Mehmet Ali Balci and Pinar Dundar, Average Edge-Distance in Graphs.Selcuk Journal of Applied Mathematics, 11, pp. 63-70, 2010.Search in Google Scholar

[3] G. Chartrand and Ping Zhang, Chromatic Graph Theory. CRC Press, 2009.10.1201/9781584888017Search in Google Scholar

[4] D. Deepthy and Joseph Varghese Kureethara, L^′ (2,1)-Edge Coloring of Trees and Cartesian Product of Path Graphs. Intetnational Journal of Pure and Applied Mathematics, 117, 135-143, 2017.Search in Google Scholar

[5] R. K. Yeh, Labelling Graphs with a Condition at Distance Two. Ph. D. Thesis, University of South Carolina, 1990.Search in Google Scholar

[6] A.P. Santhakumaran, Center of a graph with respect to edges. Scientia Series A: Mathematical Sciences, 19, 13-23, 2010.Search in Google Scholar

[7] Daifeng Guo, Hongbo Zhang and Martin D.F. Wong, On Coloring Rectangular and Diagonal Grid Graphs for Multiple Patterning Lithography. ASP-DAC, 387-392, 2018.Search in Google Scholar

[8] Douglas B. West, Introduction to Graph Theory. Second Edition, PHI, 2014.Search in Google Scholar

[8] Michael Stiebitz, Graph Edge Coloring. John Wiley and Sons, 2012.Search in Google Scholar