Colorful monochromatic connectivity

Yair Caro, Raphael Yuster

Research output: Contribution to journalArticlepeer-review

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 mc(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 mc(G) and relate it to other graph parameters such as the chromatic number, the connectivity, the maximum degree, and the diameter.

Original languageEnglish
Pages (from-to)1786-1792
Number of pages7
JournalDiscrete Mathematics
Volume311
Issue number16
DOIs
StatePublished - 28 Aug 2011

Keywords

  • Coloring
  • Connectivity
  • Monochromatic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Colorful monochromatic connectivity'. Together they form a unique fingerprint.

Cite this