Extremal graphs with maximum monochromatic connectivity

DOI10.1016/J.DISC.2020.111968zbMath1443.05104OpenAlexW3028435644MaRDI QIDQ776294

Yirong Yang, Ze-min Jin, Xue Liang Li

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111968

zbMATH Keywords

upper boundsextremal graphsmonochromatic connection numbermonochromatic connection coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (3)

Constraining MC-numbers by the connectivity of complement graphs ⋮ Multicolorful connectivity of trees ⋮ Rainbow and monochromatic vertex-connection of random graphs

Cites Work

• Unnamed Item
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• More on the colorful monochromatic connectivity
• Rainbow connections of graphs: a survey
• The (vertex-)monochromatic index of a graph
• Colorful monochromatic connectivity
• Rainbow connection in graphs

This page was built for publication: Extremal graphs with maximum monochromatic connectivity