More on the colorful monochromatic connectivity
type: Item
instance of: scholarly article
title: More on the colorful monochromatic connectivity
zbMATH Open document ID: 1375.05090
author: Ran Gu
author: Zhongmei Qin
author: Yan Zhao
author: Xueliang Li
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2017-12-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6816718
zbMATH Keywords: coloring
zbMATH Keywords: monochromatic
zbMATH Keywords: connectivity
zbMATH Keywords: random graphs
MaRDI profile type: Publication
full work available at URL: s40840-015-0274-2
OpenAlex ID: W2263686775
cites work: Q3503433
cites work: Q5422499
cites work: Threshold functions
cites work: Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
cites work: On rainbow connection
cites work: Colorful monochromatic connectivity
cites work: The 3-rainbow index of a graph
cites work: Rainbow connection in graphs
cites work: The rainbow connectivity of a graph
cites work: Q3286850
cites work: Every monotone graph property has a sharp threshold
cites work: On rainbow-\(k\)-connectivity of random graphs
cites work: Note on the hardness of rainbow connections for planar and line graphs
cites work: Rainbow connections of graphs: a survey
cites work: Characterize graphs with rainbow connection number $m-2$ and $m-3$
cites work: Graphs with 3-rainbow index \(n-1\) and \(n-2\)
cites work: Graphs with 4-rainbow index 3 and \(n-1\)
DOI: 10.1007/S40840-015-0274-2
description: scientific article; zbMATH DE number 6816718