图$ G $的${\rm{E}}$ -全染色是指使得相邻顶点染以不同色, 每条边与它的端点染以不同的颜色的全染色. 设$ f $是图$G $的${\rm{E}} $ -全染色, 图$ G $的一个顶点$ x $在$ f $下的多重色集合$ \widetilde C( x ) $是指点$ x $的颜色以及与$ x $关联的边的颜色构成的多重集. 若图$ G $的任意两个不同顶点在$f $下的多重色集合不同, 则$ f $称为图$ G $的点被多重集可区别的${\rm{E}} $ -全染色. 对图$ G $进行点被多重集可区别的${\rm{E}} $-全染色所需用的最少的颜色的数目叫做$G $的点被多重集可区别的${\rm{E}} $-全色数. 利用反证法和构造具体染色的方法, 讨论了圈与路的点被多重集可区别的${\rm{E}} $ -全染色问题, 给出了圈与路的最优的点被多重集可区别的${\rm{E}} $-全染色方案, 并确定了圈与路的点被多重集可区别的${\rm{E}} $ -全色数

An ${\rm{E}} $ -total coloring of a graph $G $ is an assignment of several colors to all vertices and edges of $G $ such that no two adjacent vertices receive the same color and no edge receive the same color as one of its endpoints. If $f $ is an ${\rm{E}} $ -total coloring of a graph $G $, the multiple color set of a vertex $x $ of $G $ under $f $ is the multiple set composed of colors of $x $ and the edges incident with $x $. If any two distinct vertices of $G $ have distinct multiple color sets under an ${\rm{E}} $ -total coloring $f $ of a graph $G $, then $f $ is called an ${\rm{E}} $ -total coloring of $G $ vertex-distinguished by multiple sets. An ${\rm{E}} $ -total chromatic number of $G $ vertex-distinguished by multiple sets is the minimum number of the colors required in an ${\rm{E}} $ -total coloring of $G $ vertex-distinguished by multiple sets. The ${\rm{E}} $ -total colorings of cycles and paths vertex-distinguished by multiple sets are discussed by use of the method of contradiction and the construction of concrete coloring. The optimal${\rm{E}} $ -total colorings of cycles and paths vertex-distinguished by multiple sets are given and the ${\rm{E}} $ -total chromatic numbers of cycles and paths vertex-distinguished by multiple sets are determined in this paper.