Pages that link to "Item:Q776294"
From MaRDI portal
The following pages link to Extremal graphs with maximum monochromatic connectivity (Q776294):
Displaying 14 items.
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- More on the colorful monochromatic connectivity (Q1684281) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Colorful monochromatic connectivity (Q2275401) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- Total monochromatic connection of graphs (Q2374173) (← links)
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs (Q2661209) (← links)
- The monochromatic connectivity of graphs (Q2663346) (← links)
- Monochromatic connectivity and graph products (Q2798325) (← links)
- Constraining MC-numbers by the connectivity of complement graphs (Q6177407) (← links)
- Monochromatic \(k\)-connection of graphs (Q6648274) (← links)