Pages that link to "Item:Q2275401"
From MaRDI portal
The following pages link to Colorful monochromatic connectivity (Q2275401):
Displayed 22 items.
- Monochromatic connecting colorings in strongly connected oriented graphs (Q507473) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- Extremal graphs with maximum monochromatic connectivity (Q776294) (← links)
- Vertex-monochromatic connectivity of strong digraphs (Q776297) (← 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)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs (Q2168716) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← 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)
- Relations of three classes of disconnected coloring (Q6153478) (← links)
- Constraining MC-numbers by the connectivity of complement graphs (Q6177407) (← links)