Pages that link to "Item:Q2663346"
From MaRDI portal
The following pages link to The monochromatic connectivity of graphs (Q2663346):
Displaying 12 items.
- Extremal graphs with maximum monochromatic connectivity (Q776294) (← links)
- Highly connected monochromatic subgraphs of two-colored complete graphs (Q905898) (← links)
- More on the colorful monochromatic connectivity (Q1684281) (← links)
- Properties of monotone connected sets (Q2037728) (← links)
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs (Q2045397) (← links)
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs (Q2168716) (← links)
- Monotone path-connectedness of strict suns (Q2172870) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Colorful monochromatic connectivity (Q2275401) (← links)
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs (Q2661209) (← links)
- Monochromatic connectivity and graph products (Q2798325) (← links)
- Effective bounds for monochromatic connectivity measures in two dimensions (Q5152128) (← links)