On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn

Article English OPEN
Liu Jun; Zhao Chuan Cheng; Yao Shu Xia; Guo Ren Zhi; Yue Qiu Ju;

A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of c... View more
Share - Bookmark