More on the colorful monochromatic connectivity

DOI10.1007/s40840-015-0274-2zbMath1375.05090OpenAlexW2263686775MaRDI QIDQ1684281

Zhongmei Qin, Yan Zhao, Ran Gu, Xue Liang Li

Publication date: 8 December 2017

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0274-2

zbMATH Keywords

random graphsconnectivitycoloringmonochromatic

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (10)

Total monochromatic connection of graphs ⋮ Monochromatic disconnection: Erdős-Gallai-type problems and product graphs ⋮ The monochromatic connectivity of graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Multicolorful connectivity of trees ⋮ Monochromatic \(k\)-edge-connection colorings of graphs ⋮ Rainbow monochromatic \(k\)-edge-connection colorings of graphs ⋮ Erdős-Gallai-type results for total monochromatic connection of graphs ⋮ Extremal graphs with maximum monochromatic connectivity ⋮ Rainbow and monochromatic vertex-connection of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rainbow-\(k\)-connectivity of random graphs
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• On rainbow connection
• Threshold functions
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• Graphs with 3-rainbow index \(n-1\) and \(n-2\)
• Colorful monochromatic connectivity
• Graphs with 4-rainbow index 3 and \(n-1\)
• Note on the hardness of rainbow connections for planar and line graphs
• Characterize graphs with rainbow connection number $m-2$ and $m-3$
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• Every monotone graph property has a sharp threshold

This page was built for publication: More on the colorful monochromatic connectivity