TY - JOUR
T1 - PATHS AND CYCLES IN COLORED GRAPHS
AU - LI, Xueliang
AU - Zhang, Shenggui
AU - Broersma, Hajo
PY - 2001/5
Y1 - 2001/5
N2 - Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all the edges of it have the same color, and is called heterochromatic if all the edges of it have different colors. In this note, some sufficient conditions for the existence of monochromatic and heterochromatic paths and cycles are obtained. We also propose a conjecture on the existence of paths and cycles with many colors.
AB - Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all the edges of it have the same color, and is called heterochromatic if all the edges of it have different colors. In this note, some sufficient conditions for the existence of monochromatic and heterochromatic paths and cycles are obtained. We also propose a conjecture on the existence of paths and cycles with many colors.
KW - (edge-)colored graph
KW - monochromatic (heterochromatic) path (cycle)
UR - http://www.scopus.com/inward/record.url?scp=34247382070&partnerID=8YFLogxK
U2 - 10.1016/S1571-0653(05)80098-8
DO - 10.1016/S1571-0653(05)80098-8
M3 - 文章
AN - SCOPUS:34247382070
SN - 1571-0653
VL - 8
SP - 128
EP - 132
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -