Pages that link to "Item:Q2312052"
From MaRDI portal
The following pages link to Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052):
Displaying 11 items.
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Fractional matching preclusion number of graphs (Q2078848) (← 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)
- Total monochromatic connection of graphs (Q2374173) (← links)
- Effective bounds for monochromatic connectivity measures in two dimensions (Q5152128) (← links)
- Erdös-Gallai-type problems for distance-edge-monitoring numbers (Q6184335) (← links)