Pages that link to "Item:Q1684281"
From MaRDI portal
The following pages link to More on the colorful monochromatic connectivity (Q1684281):
Displaying 10 items.
- Extremal graphs with maximum monochromatic connectivity (Q776294) (← links)
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs (Q2045397) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs (Q2168716) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← links)
- Total monochromatic connection of graphs (Q2374173) (← links)
- The monochromatic connectivity of graphs (Q2663346) (← links)