Color degree and heterochromatic cycles in edge-colored graphs

被引：28

作者：

Li, Hao ^{[1
,2
]}

Wang, Guanghui ^{[3
]}

机构：

[1] Univ Paris 11, CNRS, UMR 8623, Lab Rech Informat, F-91405 Orsay, France

[2] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Peoples R China

[3] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2012年 / 33卷 / 08期

关键词：

RAINBOW SUBGRAPHS; MATCHINGS;

D O I：

10.1016/j.ejc.2012.06.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Given a graph G and an edge-coloring C of G, 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, some color degree conditions for the existence of heterochromatic cycles are obtained. (c) 2012 Elsevier Ltd. All rights reserved.

引用

页码：1958 / 1964

页数：7

共 17 条

[11] Li H, 2008, UTILITAS MATHEMATICA, V77, P145
[12] Li H, 2009, ARS COMBINATORIA, V93, P129
[13] Directed triangles in digraphs
Shen, J
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (02) : 405 - 407
[14] A LOWER BOUND FOR THE LENGTH OF A PARTIAL TRANSVERSAL IN A LATIN SQUARE
SHOR, PW
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (01) : 1 - 8
[15] A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
Suzuki, Kazuhiro
[J]. GRAPHS AND COMBINATORICS, 2006, 22 (02) : 261 - 269
[16] Tuza, 1993, ANN DISCR M, P81
[17] Wang G., 2011, GRAPHS COMBINATORICS

← 1 2 →