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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-5 |
| Number of pages | 5 |
| Journal | Electronic Notes in Discrete Mathematics |
| Volume | 8 |
| State | Published - 2001 |
Keywords
- (edge-)colored graph
- Monochromatic (heterochromatic) path (cycle)