[1] PILŚNIAK M,WOŹNIAK M.On the total-neighbor-distinguishing index by sums [J].Graphs and Combinatorics,2015,31(3):771-782.
[2] DONG A J,WANG G H.Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree [J].Discrete Applied Mathematics,2014,166:84-90.
[3] LI H L,LIU B Q,WANG G H.Neighbor sum distinguishing total colorings of K4-minor free graphs [J].Frontiers of Mathematics in China,2013,8(6):1351-1366.
[4] LI H,DING L H,LIU B Q,et al.Neighbor sum distinguishing total colorings of planar graphs [J].Journal of Combinatorial Optimization,2015,30(3):675-688.
[5] CHENG X H,WU J L,HUANG D J,et al.Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ [J].Discrete Applied Mathematics,2015,190/191:34-41.
[6] 姚 丽.几类图的2-距离和可区别染色 [D].兰州:兰州交通大学,2021.
[7] BONDY J A,MURTY U S R.Graph theory with applications [M].London:The Macmillan Press Ltd,1976:1-170.
[8] 卢建立,任凤霞,马美琳.中间图的邻点强可区别全染色 [J].河南师范大学学报(自然科学版),2012,40(5):13-16.
[9] 曹 蓉,林育青,童细心.两类图的邻点可区别全染色 [J].汕头大学学报(自然科学版),2022,37(2):13-25+33. |