Color degree and heterochromatic cycles in edge-colored graphs

Authors:
Hao Li;Guanghui Wang
Affiliations:
Laboratoire de Recherche en Informatique, UMR 8623, C.N.R.S.-Université de Paris-sud, 91405-Orsay cedex, France and School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, C ...;School of Mathematics, Shandong University, 250100 Jinan, Shandong, China
Venue:
European Journal of Combinatorics
Year:
2012

Citing 6
Cited 1

Path and cycle sub-Ramsey numbers and an edge-colouring conjecture

Discrete Mathematics
Polychromatic Hamilton cycles

Discrete Mathematics
Counting subgraphs: a new approach to the Caccetta-Ha¨ggkvist conjecture

Proceedings of an international symposium on Graphs and combinatorics
Directed triangles in digraphs

Journal of Combinatorial Theory Series B
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints

Random Structures & Algorithms
Graph Theory With Applications

Graph Theory With Applications

Rainbow triangles in edge-colored graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.