Title of article
PATHS AND CYCLES IN COLORED GRAPHS
Author/Authors
LI، نويسنده , , Xueliang and Zhang، نويسنده , , Shenggui and Broersma، نويسنده , , Hajo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
5
From page
128
To page
132
Abstract
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.
Keywords
(edge-)colored graph , monochromatic (heterochromatic) path (cycle)
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453213
Link To Document