Title of article
Colorful monochromatic connectivity
Author/Authors
Caro، نويسنده , , Yair and Yuster، نويسنده , , Raphael، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
1786
To page
1792
Abstract
An edge-coloring of a connected graph is monochromatically-connecting if there is a monochromatic path joining any two vertices. How “colorful” can a monochromatically-connecting coloring be? Let m c ( G ) denote the maximum number of colors used in a monochromatically-connecting coloring of a graph G . We prove some nontrivial upper and lower bounds for m c ( G ) and relate it to other graph parameters such as the chromatic number, the connectivity, the maximum degree, and the diameter.
Keywords
Coloring , monochromatic , connectivity
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599684
Link To Document