Colorful monochromatic connectivity

Yair Caro; Raphael Yuster

doi:10.1016/j.disc.2011.04.020

Colorful monochromatic connectivity

Yair Caro, Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	1786-1792
Number of pages	7
Journal	Discrete Mathematics
Volume	311
Issue number	16
DOIs	https://doi.org/10.1016/j.disc.2011.04.020
State	Published - 28 Aug 2011

Keywords

Coloring
Connectivity
Monochromatic

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.04.020

Cite this

@article{0b6cca2f85154f069f06455a839b20a3,

title = "Colorful monochromatic connectivity",

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.",

keywords = "Coloring, Connectivity, Monochromatic",

author = "Yair Caro and Raphael Yuster",

year = "2011",

month = aug,

day = "28",

doi = "10.1016/j.disc.2011.04.020",

language = "English",

volume = "311",

pages = "1786--1792",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "16",

}

TY - JOUR

T1 - Colorful monochromatic connectivity

AU - Caro, Yair

AU - Yuster, Raphael

PY - 2011/8/28

Y1 - 2011/8/28

N2 - 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.

AB - 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.

KW - Coloring

KW - Connectivity

KW - Monochromatic

UR - http://www.scopus.com/inward/record.url?scp=79959219864&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.04.020

DO - 10.1016/j.disc.2011.04.020

M3 - Article

AN - SCOPUS:79959219864

SN - 0012-365X

VL - 311

SP - 1786

EP - 1792

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 16

ER -

Colorful monochromatic connectivity

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this