Title of article
Rainbow numbers for certain graphs
Author/Authors
Izolda Gorgol، نويسنده , , Izolda and ?azuka، نويسنده , , Ewa، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
3
From page
77
To page
79
Abstract
A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For a given a graph H, a rainbow number is the minimum number r b ( n , H ) such that any edge-colouring of K n with at least r b ( n , H ) number of colours contains a rainbow copy of H. We determine the rainbow numbers for certain stars with one edge added and for complete graphs with one edge added.
Keywords
rainbow number , anti-Ramsey number
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454267
Link To Document