Pages that link to "Item:Q1752632"
From MaRDI portal
The following pages link to Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632):
Displaying 12 items.
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Vertex-monochromatic connectivity of strong digraphs (Q776297) (← links)
- The (vertex-)monochromatic index of a graph (Q2012896) (← links)
- Fractional matching preclusion number of graphs (Q2078848) (← 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)
- The \(g\)-component connectivity of graphs (Q2232610) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- On the \(g\)-good-neighbor connectivity of graphs (Q2283037) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← links)
- Total monochromatic connection of graphs (Q2374173) (← links)