本文研究了圈Cm和路Pm的Mycielski图的点可区别边染色问题.利用构造法给出了M(Cm)图的点可区别边染色法,得到了它的点可区别边色数,进而从图的结构关系,有效获得了M(Pm)图的相应点可区别边染色法和其边色数.该方法对研究存在结构关系的图染色问题具有重要的借鉴意义.
In this paper,we discuss the problem of the vertex-distinguishing edge-coloring on M(Cm) and M(Pm).We present the vertex-distinguishing edge-coloring on M(Cm) and obtain the vertex-distinguishing edge chromatic number of M(Cm) by using constructive method.Moreover,we derive the vertex-distinguishing edge-coloring and the vertex-distinguishing edge chromatic number of M(Pm) efficiently and correspondingly by means of the structural relations between M(Pm) and M(Cm).This method of the research provides an important reference for us to study the coloring problem of graphs with structural relations.