科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let c be an edge-colouring of a graphG such that for every vertexv there are at least d >= 2 different colours on edges incident tov. We prove that G contains a properly coloured path of length2d or a properly coloured cycle of length at leastd+1. Moreover, if G does not contain any properly coloured cycle, then there exists a properly coloured path of length 3x2d-1-2.
- 出版日期2014-5
