Extremal graphs with maximum monochromatic connectivity
From MaRDI portal
Publication:776294
DOI10.1016/J.DISC.2020.111968zbMATH Open1443.05104OpenAlexW3028435644MaRDI QIDQ776294FDOQ776294
Authors: Yirong Yang, Zemin Jin, Xueliang 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
Recommendations
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
Cited In (14)
- The monochromatic connectivity of graphs
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Colorful monochromatic connectivity
- Multicolorful connectivity of trees
- Constraining MC-numbers by the connectivity of complement graphs
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
- Monochromatic \(k\)-edge-connection colorings of graphs
- Further results on the total monochromatic connectivity of graphs
- Monochromatic connectivity and graph products
- Monochromatic \(k\)-connection of graphs
- More on the colorful monochromatic connectivity
- Rainbow and monochromatic vertex-connection of random graphs
- Total monochromatic connection of graphs
This page was built for publication: Extremal graphs with maximum monochromatic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776294)
