A note on the vertex-distinguishing proper edge coloring of graphs

作者：Zhu Enqiang^*; Liu Chanjuan

来源：Ars Combinatoria, 2014, 116: 93-99.

• vertex-distinguishing edge coloring
• vertex-distinguishing edge chromatic number
• subgraph
• cycle
• fan

The number of colors, required to color properly the edges of a simple graph G in such a way that any two vertices are incident with different sets of colors, is referred to as vertex-distinguishing edge chromatic, denoted by chi(vd)'(G). An interesting phenomenon on vertex-distinguishing proper edge coloring is concerned in this paper. We prove that for every integer m >= 3, there is always a graph G of maximum degree m with chi(vd)' (G) < chi(vd)'(H), where H is a proper subgraph of G.

• 出版日期2014-7
• 单位北京大学