Extremal graphs with maximum monochromatic connectivity
type: Item
instance of: scholarly article
title: Extremal graphs with maximum monochromatic connectivity
zbMATH Open document ID: 1443.05104
author: Yirong Yang
author: Zemin Jin
author: Xueliang Li
published in: Discrete Mathematics
publication date: 2020-07-08T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7218797
zbMATH Keywords: monochromatic connection coloring
zbMATH Keywords: monochromatic connection number
zbMATH Keywords: upper bounds
zbMATH Keywords: extremal graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2020.111968
OpenAlex ID: W3028435644
cites work: Q5422499
cites work: Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
cites work: Colorful monochromatic connectivity
cites work: Rainbow connection in graphs
cites work: More on the colorful monochromatic connectivity
cites work: Rainbow connections of graphs: a survey
cites work: The (vertex-)monochromatic index of a graph
DOI: 10.1016/J.DISC.2020.111968
description: scientific article; zbMATH DE number 7218797