Hits :

First Author : Chuandong Xu

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : European Journal of Combinatorics

Volume: Vol.54

Page Number : 193-200

ISSN : 0195-6698

Translation or Not : no

Abstract : An edge-colored graph H is called rainbow if e(H) = c(H), where e(H) and c(H) are the number of edges of H and colors used in H, respectively. For two graphs G and H, the rainbow number rb(G, H) is the minimum number of colors k such that for every edge-c