Extremal graphs with maximum monochromatic connectivity
From MaRDI portal
Recommendations
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)