文献类型：期刊文献

英文题名：A Note on Heterochromatic C ₄ in Edge-Colored Triangle-Free Graphs

作者：Wang, Guanghui[1];Li, Hao[2];Zhu, Yan[3];Liu, Guizhen[1]

机构：[1]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China;[2]Univ Paris 11, Lab Rech Informat, UMR 8623, CNRS, F-91405 Orsay, France;[3]E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2012

卷号：28

期号：6

起止页码：901

外文期刊名：GRAPHS AND COMBINATORICS

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000310469000012)】；

基金：This research was supported by NSFC Grants (61070230, 11026184, 11101243), IIFSDU (2009hw001), RFDP (20100131120017) and SRF for ROCS.

语种：英文

外文关键词：Heterochromatic cycle; Color neighborhood; Color degree

摘要：Let G be an edge-colored graph. A heterochromatic cycle of G is a cycle in which any pair of edges have distinct colors. Let d (c) (v), named the color degree of a vertex v, be defined as the maximum number of edges incident with v, that have distinct colors. In this paper, we prove that if G is an edge-colored triangle-free graph of order n a parts per thousand yen 9 and for each vertex v of G, G has a heterochromatic C (4).