Pages that link to "Item:Q512870"
From MaRDI portal
The following pages link to Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870):
Displaying 14 items.
- Extremal graphs with maximum monochromatic connectivity (Q776294) (← links)
- More on the colorful monochromatic connectivity (Q1684281) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- The (vertex-)monochromatic index of a graph (Q2012896) (← links)
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs (Q2045397) (← 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)
- Monochromatic connectivity and graph products (Q2798325) (← links)
- Erdös-Gallai-type problems for distance-edge-monitoring numbers (Q6184335) (← links)
