%A ZHANG Shuang, ZHU Yan
%T 2-factor of edge colored graph
%0 Journal Article
%D 2021
%J JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
%R 10.6040/j.issn.1671-9352.0.2019.156
%P 24-28
%V 56
%N 1
%U {http://lxbwk.njournal.sdu.edu.cn/CN/abstract/article_3387.shtml}
%8
%X Let *G *be an edge colored graph. For a vertex *x *of *G*, the color neighborhood *CN(x)*of *x* is defined as the set *{c(xy)|xy∈E(G), y∈V(G)}. G *is properly colored if no adjacent edges have the same color. If every edge colored graph *G *has *|CN(u)∪CN(v)|≥*4*n/*3*+*8* *for every pair of vertices *u *and *v *of *V(G), *the *G *contains a properly colored 2-factor.