List neighbor sum distinguishing edge coloring of subcubic graphs |
| |
Authors: | You Lu Chong Li Rong Luo Zhengke Miao |
| |
Affiliation: | 1. Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, PR China;2. Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA;3. School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu 221116, PR China |
| |
Abstract: | A proper -edge-coloring of a graph with colors in is neighbor sum distinguishing (or, NSD for short) if for any two adjacent vertices, the sums of the colors of the edges incident with each of them are distinct. Flandrin et al. conjectured that every connected graph with at least vertices has an NSD edge coloring with at most colors. Huo et al. proved that every subcubic graph without isolated edges has an NSD -edge-coloring. In this paper, we first prove a structural result about subcubic graphs by applying the decomposition theorem of Trotignon and Vu?kovi?, and then applying this structural result and the Combinatorial Nullstellensatz, we extend the NSD -edge-coloring result to its list version and show that every subcubic graph without isolated edges has a list NSD -edge-coloring. |
| |
Keywords: | List neighbor sum distinguishing edge coloring Combinatorial Nullstellensatz Subcubic graph |
本文献已被 ScienceDirect 等数据库收录! |
|